there is a square matrix of the following form: [['E','2','3'], ['3','X','1'], ['4','3','S']] S-start point E-end point X-cannot cross there and a person starts from S to go E and can only move up,left,diagonal(up+left) and find the sum of the numbers walked to reach S->E and it there is no way to cross Because of many 'X' then print 0
Pattern , string,array,tree, graph,linked list
three coding questions are there and time for each question is 20 min.
What are your strengths and weaknesses
Questions that they asked were on Leetcode.
Mostly on networking and data structures.
Elaborate on a project from previous work experience / personal project. Explain design and technology choices, etc.
Various questions to judge your practical experience such as "have you used version control before" and "do you know what a linter is."
Tell me why are you here and what job you are looking for?
Difference between array, linked list, hash table with complexities and uses of each
Viewing 4151 - 4160 interview questions