Flipkart Interview Report
- 0of 0 votes
Answersu hav root a node address and length is given
- varun jain June 26, 2010
u need to find all the node frm give node which can be reachabe upto the given length. It can be left or right or top of node. but tree is simple binary which donot hav parent link| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer - 0of 0 votes
AnswersImplement a phone book.
- varun jain June 26, 2010
1. u can search either by name or phone number.
2. u can serach by prefix also.
3. They want to write whole code with proper syntax..
I told its possible by hashing thn i come to tri... but whole code is too big to write. I almost took 1.5 hour to write| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer Algorithm - 0of 0 votes
Answersthere is 1000*1000 matrix each row is filed with 0 and 1 . left 1 right 0 once a 0 come thn 1 cannot come..
- varun jain June 26, 2010
U have to find out the row which has maximum 1 and no. of 1 in that row..
This thing hav to do in complexity O(n+constant)| Report Duplicate | Flag | PURGE
Flipkart Software Engineer / Developer
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.