Given an n*m grid, you enter the grid at some cell in the first row and leave the grid at some cell in the nth(last) row. Every cell has four directional parameter, indicating whether the cell in that direction can be visited. Print the Shortest possible path.
In the phone interview, they asked me what technologies about Microsoft was exciting.
find a pattern that matches in string.
what is rest apis how to designs a code sand box
Algorithm questions What's you most difficult project? Experience that conflict with teammate.
LRU Cache ( refer the leet codes).
Check Linked List is Palindrome.
For internships standard leetcode medium DSA (no system design).
he then directly moved to DSA he asked me about the DS concepts i know based on that he asked total 3 dsa questions 1st Q Valid Parenthesis 2nd Q Check whether the tree 2 is subtree of Tree 1 or not 3nd Q LCA in BST
What was the hardest thing you have worked on?
Viewing 761 - 770 interview questions