is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
I don't get it. Why do we have to visit each node? Why not just go to the min node (left most node) by recursively going to left node until there are no more left nodes. And then once there are no more left most nodes, start storing the nodes in a stack and continue traversing tree in in-order style. Once the size of stack is equal to n, then the top most element of stack will be the result.
- the.umer1 January 20, 2013