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 a graph problem which needs topological sorting. Here is the logic:
- baks November 19, 20151. Build a graph by reading each element in the array. Add an edge between reports_to and employee node.
2. If the reports_to field is blank then mark that vertex as the Start vertex
3. Perform a topological search starting with the Start vertex and store the information in an array of lists
4. Print the array of list. Each list in array represents one level.