Round 1
Questions:
You are given an undirected and unweighted graph of uppercase nodes. Alice is at A and Bob is at B. Both need to reach D.
Both can go in the same car from a common edge.
Compute the minimum distinct edges required for Bob and Alice to reach D.
A -- F | \\\ C -- E --D | B -- G -- H
Answer: 4
Paths:
- A-C-E-D
- B-C-E-D
Candidate's Approach
The candidate identified the paths that Alice and Bob could take to reach D while minimizing the number of distinct edges used. They recognized that both could share the path from C to E to D, thus reducing the total distinct edges required.
Interviewer's Feedback
No feedback provided.