Amazon Interview Question
SDE-2sCountry: United States
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.
We approach this problem as a topological sorting problem:
We traverse the graph checking for circular dependencies while marking all nodes visited
The traverse yields 2 results: the execution order + all the possible starting points ("sub graphs"):
The above code results with:
This means: we have 3 starting points (i.e. three separate processes), which needs 21 time units for execution (we simply sum and keep track of the longest sequence)
- PenChief April 24, 2019