Minimum Path Node Count with an Optional Broken Vertex

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Return the fewest vertices on a graph path while optionally excluding one broken vertex, then compare the follow-up that permits it. The problem covers endpoint rules, unreachable results, same-vertex paths, adjacency-list scale, and precise node-versus-edge distance.

Read the full Google Software Engineer interview experience this question came from