Here Interview Question for Software Developers


Country: United States
Interview Type: In-Person




Comment hidden because of low score. Click to expand.
0
of 0 vote

Standard topological sort question. BFS wont work the standard way, you will have to maintain list of ancestors throughout traversal if you use BFS. It is possible to do it through BFS but will take more storage etc. With DFS as its recursion based, you dont need to store everything.

The second part is basically to detect a cycle in a graph, which can be done using topological sort or DFS in a simple way. BFS can also be used but as I mentioned before, its going to be difficult as you will have to store ancestors.

- jbtron July 17, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Check out Topological sorting on wikipedia

- Adrien July 17, 2015 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More