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.
This is the same question as, give a binary tree and a node, find all the nodes which are at a distance k from the given node in the tree. Distance is just number of links in any direction. I think the steps should be following:
- NeoX April 22, 20121) First find the distance of given node N from root. Lets say its d.
2) Finding nodes at a distance k from N going down is easy. Just traverse the tree with N as root and print all nodes at level k.
3) Finding nodes at a distance k from N going up is somewhat tricky, We start with nodes at distance d-k from root and print them out, then nodes at d-k-1 and print nodes at distance 1 going down and so on.
I hope you get the idea.