Object Oriented Concepts, Linked Lists, Recursion, Arrays, String. Questions were straight-forward but finding the most efficient solution could get slightly tricky. Make sure to explain your answer as you go and discuss with them instead of thinking of it as a question-answer session.
Which Microsoft Product you most like and dislike
The interviewer had the code from the previous interviewee still on the white board in the room. He asked me to identify what the code did (printed the contents of a binary tree through a BFS using a queue). Then asked me to identify the bugs with the code and suggest how to fix it (null-pointer exceptions when printing out the values from the queue and checking for nulls before adding a value to the queue).
Logic to find the LCA of tree and node has pointer to parent node.
LRU Cache, Binary Search, Hash Map
Given an array of data, find all of the local maximum.
Reverse word question
Read XML file and create N-array tree
Simple design questions like messaging and elevator controller
Given an NXN array, filled with battleships that can only be horizontal or vertical, count how many battleships are there in the board. The battleships will always have at least one horizontal/vertical space between them. Solution should be with no extra memory, one pass, and without changing the board.
Viewing 2091 - 2100 interview questions