aaron liang
BAN USER
Comments (12)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
dude, need o(n) space
- aaron liang September 18, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
did not say they are int or double....
if there are string or one int one double????
Comment hidden because of low score. Click to expand.
0
of 0 vote
no
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
I think this one only can check if the tress is binary , not sure for bst
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
@sanjay is that good one ?
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
this will be cool
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
millions of numbers? how many memory do you have? even if you use hash set , it should be more simple. when it returns false, that means the number is duplicate.
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
what do u mean by abs ???? can somebody explain?
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
so nice.
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
why not use hash set?
- aaron liang September 16, 2012Comment hidden because of low score. Click to expand.
0
of 0 vote
this algorithm is so cool.........I did it for another problem today..
- aaron liang September 16, 2012Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Open Chat in New Window
Open Chat in New Window
cant understand. seems good.
- aaron liang September 18, 2012