Probably the most difficult question they asked me was, he put a binary tree on the whiteboard and I had to write a function that would find if the tree was symmetrical or not. Anyone who's familiar with data structures and recursion should be fine with this, just don't freak out when they propose the question.
What would u do if deadline is approaching and ur product is not finished?
implement a stack with a method which can return the minimal value in the stack without remove this value.
Write an algorithm to return the intersect of two arrays.
Q3) Few questions on design patterns(Interpreter/ Observer/State) etc.
1) Given an array of numbers where each number has a duplicate except one, write a program to return the lone number.
Given two (huge) sets, what is an efficient way to find their intersection?
Given an integer N and an array of unsorted integers A find all pairs of numbers within A which add up to N. (This is the only question I can remember and I had trouble thinking of an answer at the time)
Telephone interview: Find largest integer from an array of integers. The integers in the array are arranged in strictly increasing (no 2 integers are same) or strictly increasing then decreasing; so like a curve and you have to find the peak. Discuss time complexity. Write code.
Test if a Binary tree is BST or not
Viewing 1401 - 1410 interview questions