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.
1.first find the reference Node(say R)
- adam April 12, 20132. now print all the nodes in subtree, with R as the root ,that are at distance k from R
3.Now go to R's parent(say p1),find which child R is..i.,e Right or Left,now ignore R and its subtree and print all nodes under P1 that are at distance k-1.
4.Go to P1's parent(say P2) and repeat procedure similar to Step 3.
5.Repeat the procedure till the parent (Pk) is reached.