krithick.krishnagiri
BAN USER- 0of 0 votes
AnswersDesign a parking lot where cars and motorcycles can be parked.
- krithick.krishnagiri in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Object Oriented Design
I mean for dfs u would make use of a for or while loop, the question says that we shouldn't use loops..
- krithick.krishnagiri April 13, 2011how would you find the 10th largest value without knowing the other smaller values?
- krithick.krishnagiri April 11, 2011This problem doesn't have any negative value..
- krithick.krishnagiri April 11, 2011won't dfs traversal use a loop.. we shoudn't be looping..
- krithick.krishnagiri April 11, 2011Regarding the first question, I think it should be done using HashMap with ticketNo being the key and personName being the value, but I am not sure on how to do it.
- krithick.krishnagiri April 05, 2011HashMap would be better because it has a constant or near constant time complexity..
- krithick.krishnagiri April 05, 2011
RepElkeRoll, Animator at A9
I am Elke from the USA. I am working as a technologist in Hill-Behan company. I perform and analyze the ...
Repgenoimthomas666, Android test engineer at 8x8
Hey, I'm a Training and Development Manager. And I love my work. Apart from this, I am doing some ...
RepAlvaPolly, Animator at ADP
I am Alva , working as a Brand Specialist with two years experience in Keeney's. I’ve excellent communication and ...
Find the position of both nodes A and B, if A < B then divide B by 2 till its value is less A, then continue the same with A and repeat it again till A = B.
- krithick.krishnagiri April 19, 2011