Friday Evening (After 4:30 pm)

Interview - Two rounds on one day

Round 1 Round 2

Waited for a long time as there were many candidates. Waited for a long time as there were many candidates. Facilities were too good!

Implement Queue using Stack.

Implement Stack using Queue.

Convert a map into a list.

List the order in which a Class loads into memory. What are all possible things that can be added in a Java class? (static, non-static, blocks, etc.)

Given a Binary tree, print all elements of the vertical lines.

Given a list 0 0 0 0 0 and a reference to a node in the list, with Node next reference, remove the node. How?

Given two lists:

2 4 23 56 7 8 99 5 8 556 45 78 56 7 8 99

Find the indexes at which they intersect, and from there, all elements in the list are the same.