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.
My first thought is to construct a directed graph and use BFS.
- popeye123 July 27, 2018Start with first node and put it in Hashset1.
for i= 1 to N.
1. If node 1 exists in any of the hashsets
then all child nodes(only 1 level) of first node go into other hashset. I know this is not a proper pseudo code. I am half-asleep