Phone interview 1 : a) Simulate a Queue with stacks ?
b)Find repeated occurrence of character in a string ?

Phone interview 2 : a) Given a 2D matrix of numbers find the position of number . Constraints of matrix number always in increasing order left to right and top to bottom .

b)When should version control be used . And a tricky discreet math problem ?

Onsite Interview 1 a): Write a program to check whether a number is prime . Additional constraints consider negative primes etc.

b) some kind of list merge problem

A list of lists eg : [A,B,C] // unsorted

A= [1,2,3]
B=[2,3]
C=[1,2]

Start with List in reverse alphabetical order
eg:C merge with B removing duplicates then merge this with A doing the same .

Optimize solution

c) Intersection of two Integer lists ?

Onsite Interview 2 a): check whether a number is the power of 2

b) Skyline silhouette puzzle .

c) Discussion on uses of hash-tables and trees ?

d) Few general questions on Work and academic background .

Onsite Interview 3 a): write a program to find whether a list of integers has a pair whose sum is equal to a give number . More constraints added , negative numbers , duplicates , needed to optimize and even prove worst cast performance .

b) Networking question of Sliding Window over udp.

Onsite Interview 4 a): Breadth first Search related graph question

b) Additional graph question related to finding a subgraph with some API specified , needed to extend the prior solution.

c) Question on C/C++ Static Modifier , relation of it to Java.

How would you explain the Internet to a five year old?

Why should we hire you?

Where do you see yourself in five years?

Write a program the generates the power set of a set of numbers

I had questions about collections in Java and memory management questions in C.

Develop an algorithm for finding the shortest distance between two words in a document. After the phone interview is over, take a few hours to develop a working example in C++ and send it to the manager.

Pick any Google product and tell me how you would improve it

* Describe a balanced binary tree.
* When would you want to use a balanced tree rather than a hashmap?

* Describe preorder, inorder, postorder.

* Write a function, preferably in C or C++, to reverse a string.

* Describe the design of a most-recently-used list, such as the "Recent Files" menu in Microsoft Word. It has two public methods, getlist() and access(str), which retrieve the list and mark an item as accessed, respectively. The list has a maximum number of items it can hold, say 5, and it should not have duplicates. Describe the data structure used and the running time of both public methods.

* You have a data structure of integers, which can be negative, zero, or positive, and you need to support an API with two public methods, insert(int) and getmedian(). Describe a data structure you would use to support this API and describe the running time of the two methods.

* Imagine you're writing a function that takes an array of integers and an integer and it needs to return true if any pair in the array sum to the 2nd argument. The array can have negative numbers, zero, or positive numbers. Describe how you would design this function and what its running time would be. I ran through the trivial n^2 solution, then modified it to an nlogn and finally to a linear solution.