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.
If distance is 1 this will be true but how about greater than 1? it also says:
- Jin August 29, 2014"another example is F(root.7,2) will the return nodes 12,4"
It seems to me that this should be a graph problem rather than a tree problem. A tree is also a graph so maybe we should build a graph from the tree, then use dfs to find target(7) first, than use bfs to find nodes in the given distance(1 or 2 in the example)