chamy50
BAN USER
Comments (6)
Reputation 30
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.
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
I dont understand the need of complex data structures,
take to indexes prev and current, and a counter count, increment count oly if current is not equal to previous,keep incrementing prev and current as well... stop when count is equal to k...
correct me if im missing something...
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
No it doesnt, you are converting the given tree into doubly linked list... and hence you are not using any extra space... the latter part is pretty straight forward....
- chamy50 July 16, 2012