freeninza
BAN USER
Questions (3)
Comments (5)
Reputation 0
- 0of 0 votes
AnswersGiven a binary tree, where each node has some value.
- freeninza in United States
Print the path with maximum value.| Report Duplicate | Flag | PURGE
Amazon Coding - 0of 0 votes
AnswersDesigna a phone book - basically contact book on phone.
- freeninza in United States
Give data structures and give time complexity to search a phone number.
Ex: search - freeninza and if found in your phone book return the mobile number of user.| Report Duplicate | Flag | PURGE
Amazon Application / UI Design - 0of 0 votes
AnswersGiven 2 strings find if they are anagram
- freeninza in United States| Report Duplicate | Flag | PURGE
Amazon Algorithm
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
Let's say n/2 coloumn has all 1 , OR even if some of those has 1 in it then ?
ok i am figuring out something here but not clear.
Please elaborate, with the help of interviewer I could find out a solution with 0(m+n), but i think anything with binary search would still be better.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
ok i may be understanding the solution in a different way. But the question has ONLY rows sorted(ie, values in rows are sorted).
- freeninza October 14, 2012Ex matrix (4 rows, 3 colmuns):
011 <= 1st row sorted so 1s are at end
001 <= 2nd row sorted
000 <= 3rd row, all 0s
011 <=4th row with 1s at end