Interview Question

Country: United States

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

Use Djikstra Shortest path algorithm between friend A and friend B with each edge cost as 1 .
The result would give you the degree of connection between them.

- kevseb1993 November 03, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
of 1 vote

Normally you can run a Breadth First Search, but in a large network like Facebook you should probably employ some optimisations. Heuristics work great, e.g. people from the same country/city are more likely to lead you faster to the solution.

- wefgef November 09, 2016 | Flag Reply

Add a Comment

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


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


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