back to Raw Signal
Login
|
Join
Interview Tips
ALPHA
Helping you find your passion
Microsoft
Google
Algorithm
Puzzles
Videos
Forums
Microsoft 32GB Zune
,
Loodgieter Rotterdam
This Year's Popular Posts
Top Today
|
Yesterday
|
This Week
|
This Month
|
All Time
There are no results
Subscribe
Recent Forum Activity
Cisco has made it possible for the community worldwide to make a strong and consistent link whether in business or education. Cisco routing and LAN sw
Popular Tags
Loading ...
Found A Bug?
Let us know about it.
Latest Blog Posts
Find the duplicate number
Design a web crawler
Finding The Magic Pair
Is a tree balanced?
Amazon Phone Screen
Top General Things You need to know about Computers Before a Tech Interview
What is a buffer overflow and how do you exploit it?
Trailing Zeroes in a factorial problem
Reverse the words in a string
InterSection Problem
View All
Recent Comments
Sort the numbers in ascending order Start scan the numbers linearly by finding the difference between the two adjacent numbers in a loop Set a loca
/** * Find the first common ancestor of two given nodes in a binay search tree. * * @param args * @author Pramod Chandoria */ public stati
/** * Find the first common ancestor of two given nodes in a binay search tree. * * @param args * @author Pramod Chandoria */ public stati
What the fuck are u publishing here...
this is shit.....
This Question is about binary tree and not binary search tree. Binary search tree is an extremely trivial case of this problem. Secondly. just saying
You mean, like 1 7 8 11 12? Fail.
sort the numbers in ascending order and the pair will be the first two!!!
sort the numbers in ascending order and the pair will be the first two!!!
drop it in the 50th floor. If it breaks start at floor 1, will take 50 tries in this case. If it doesn't drop on floor 25, repeat the same idea from t
This Week's Popular Blog Posts
There are no results
View All