This assessment verifies the Graphs module. Passing it contributes up to 5 points in the 56-60 score band.
Questions
8
Limit
90m
Pass
85%
Score
+5
12 pts
A SaaS product has users, teams, projects, roles, and inherited permissions. Teams can belong to multiple parent teams. A teammate wants to model this as a tree. Review the model and propose a graph representation.
11 pts
Given directed edges `[source, target]`, build an adjacency list. Preserve nodes that only appear as targets. State complexity.
13 pts
Return the shortest hop count between two nodes in an unweighted graph. Explain why the first time BFS reaches the target is optimal.
13 pts
A grid incident model marks several failed servers at minute 0. Each minute, failure spreads to adjacent healthy servers. Design the algorithm to compute when all reachable servers fail, and explain how unreachable healthy servers are handled.
13 pts
A course-prerequisite checker uses one boolean `visited` set in DFS. If a course is visited, the code assumes there is a cycle. Review the bug and give the correct directed-cycle strategy.
12 pts
Given `n` nodes and undirected edges, decide whether the graph is a valid tree. Compare checking `edges.length === n - 1` alone with the full solution.
15 pts
A delivery routing service has non-negative travel-time edges. A candidate proposes BFS because it finds shortest paths. Review the mistake and design a Dijkstra-style solution, including stale priority-queue entries.
11 pts
Which answer best matches shortest-path algorithm choice to graph constraints?