Available question text
Given a directed graph where each edge has an associated security clearance level, find the minimum security clearance level required to travel from a source node to a destination node. As a follow-up, extend the solution to also account for edge weights and find the shortest path while minimizing the required security clearance level.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Minimum Security Clearance Level for Graph Traversal
Reported Aug 31, 2026 · 2 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source