I th round
1. Bubble sort, Quick sort revised version complexities
II nd round
1. Common ancestor for two nodes in a binary tree
2. Linked list loop - find
III rd round
1. Polynomial Multiplication. Given two polynomials, each of one variable, return the multiplication of two polynomials.
IV th round (technical)
1. Yahoo database login information, sort, given user information, return all the information about him. Distributed problem how to approach
2. Yahoo messenger - Design approach
V th round
1. HR
1. Bubble sort, Quick sort revised version complexities
II nd round
1. Common ancestor for two nodes in a binary tree
2. Linked list loop - find
III rd round
1. Polynomial Multiplication. Given two polynomials, each of one variable, return the multiplication of two polynomials.
IV th round (technical)
1. Yahoo database login information, sort, given user information, return all the information about him. Distributed problem how to approach
2. Yahoo messenger - Design approach
V th round
1. HR
No comments:
Post a Comment