Facebook Interview Question for SDE1s

Country: United States

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

If that's the node p of G where sum of paths p to n1 and p to n2 is minimal:
1) reverse edges, since it's a DAG
2) run bi-source bfs form n1 and n2. The node where the frontiers first meet is the desired node p.

- Chris December 10, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 vote

starting from root
for all neighbours of the current node, 
	if search(p1)&&search(p1) == TRUE
		set node to this neighbour
	else if search(p1)^search(p2) == TRUE
		return current node

- aman.bansal4u May 30, 2018 | 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