The questions are pretty regular, but the second interviewer suppressed my proposals and made me think in his approach. We kind of had some conflict, but I have to admit his algorithm is easier to implement. Remember: do not try to be a smart ass in front of your interviewer.
I was asked to give an example of a multithreading code which I wasn't sure of at that moment. So the interviewer skipped that question.
Find the youngest common ancestor in a directed graph, where you can only go to a node's parent and cannot go back
Just algorithmic and data structure questions.
Nothing unexpected.
The questions were straight forward, a linked list question, a string question and an algorithm question, no surprises just standard questions. The first interviewer had me write code in C++, the second one said he did not care very much about syntax.
N th element in a binary tree. Mirror Image of a Binary tree Queue using stacks. Garage class model.
How do you create a routing table?
Zig Zag tree traversal, create something similar to your t9 dictionary.
The questions were not tricky. They were very helpful and guided me through the problems.
Viewing 1361 - 1370 interview questions