Friday, December 3, 2010

Interview question

1. Find two numbers in a binary search tree
which add up to X.

Solution : Convert it to doubly linked list, using recursion : O(lgn) space,
and have head tail pointers like what you would have done for a sorted array.

Some more discussion .

2. What are prepared statements in MySql?

3. table (empname,designation,mgrId,empId)
find employee name, manager name

4. What if the load balancer fails, what is the back up strategy?

5. What happens when you hit in the browser.

No comments:

Blog Archive