Construct a unique tree in its exact form given an inorder and preorder traversal. Only question I had trouble on, all the other questions I killed. Some of my linear time solutions I even had to spend time explaning WHY it ran in linear time, in other words the interviewer was not solid in his data structures. Got 4/5 questions, resulted in a shocking reject.
find cycle in linked list
Write a pgm to find out if call stack address is increasing or decreasing
One coding question to do with text parsing, nothing too complicated. One coding question to do with dynamic programming or greedy algorithm. One design question.
Design LRU Cache
What will you do if you get rejected in this interview?
Unexpected question:Code to swap numbers without third variable and reverse of a number.
Given two numbers, how can you transfer the value of one to the other without using a third variable?
Simple programming questions, how to find the median of a singly linked list by only passing through it once.
Write an application that maps out a large set of data in as little time as possible.
Viewing 1821 - 1830 interview questions