Flipkart Interview Report
- 0of 0 votes
AnswersFind median of an unsorted array (better in nlogn solution is needed)
- Anonymous April 08, 2011| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer Algorithm - 0of 0 votes
AnswersA group of persons is fighting on a road. We have details about who punched whom, and there are only two groups, and a person will punch only a person from another group. What data structure would you choose for the input, output and write a fully functioning program for this.
- Anonymous April 08, 2011| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer Algorithm - 0of 0 votes
AnswersA binary tree is represented in a array as the ancestor array, build the binary tree from this array.
- Anonymous April 08, 2011
eg
1
|
2---------------- --------------3
|
------------------
4 5
The array would be
1 2 3 4 5
1 x 1 1 1 1
2 0 x 0 1 1
3 0 0 x 0 0
4 0 0 0 x 0
5 0 0 0 0 x
where if i isAncestor of j, a[i][j] would be set to 1| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer Algorithm - 0of 0 votes
AnswersA number is given as a palindrome, write a function to return the next largest palindrome.
- Anonymous April 08, 2011| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer Algorithm - 0of 0 votes
AnswersFor a binary tree, print all possible paths from root to leaf nodes
- Anonymous April 08, 2011| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer Algorithm