Software Engineer / Developer Interview Report
- 0of 0 votes
AnswerTower of Hanoi and it's time complexity for tower with n disks.
- Cartman October 19, 2010| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm - 0of 0 votes
AnswersImplement count Non-leaf nodes on a binary tree.
- Cartman October 19, 2010| Report Duplicate | Flag | PURGE
Software Engineer / Developer Trees and Graphs - 0of 0 votes
Answers1. Compare and contrast Arraylist and Linked list based on time complexity of various operations.
- Cartman October 19, 2010
2. Inserting into Arraylist and it's complexity. Consider dynamic memory allocation in order to expand the list.| Report Duplicate | Flag | PURGE
Software Engineer / Developer Data Structures - 0of 0 votes
AnswersGiven a sorted integer array (e.g. 1 2 3 4 5). It is shifted by k pos to right (e.g. for k=2 and the new array is (4 5 1 2 3). Find what's the value of k based on the new array.
- Cartman October 19, 2010
Hint: O(n) solutions is obvious. Can you do better? say O(lg n).| Report Duplicate | Flag | PURGE
Software Engineer / Developer Arrays - 0of 0 votes
AnswersIn an XY plane, find number of path from origin(0,0) to any point (x,y) subject to following conditions:
- Cartman October 19, 2010
1. x,y are +ve integers
2. From a position you can move either right or up.
int numPaths(x,y)
(Hint: It can be solved by dynamic programming)| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm