Graph questions test representation, traversal, dependency reasoning, and component structure.
Loading Engineering Foundry…
Loading Engineering Foundry…
Model entities and relationships, then traverse while controlling revisits and state.
Graph questions test representation, traversal, dependency reasoning, and component structure.
Use O(V + E) for adjacency traversal and include queue, stack, or disjoint-set storage.
These clues narrow the model. They do not replace an invariant or complexity check.
Exact active distribution: 1 easy, 8 medium, 1 hard. External records contain metadata and original guidance only.
Treat a grid as an implicit graph and mark each cell once.
Map each original node to exactly one clone before following cycles.
Recognize a feasibility question as directed-cycle detection.
Detect the first edge whose endpoints are already connected.
Build an adjacency model from route membership and traverse with bounded transfers.
A transit network lists the stops served by each route. Given a start stop, destination stop, and maximum number of route transfers, determine whether the destination is reachable. Avoid revisiting both stops and routes.
Memoize an acyclic increasing traversal from each cell.
Introduces a grid as an implicit graph with explicit visited-state choices.
Adds a returned aggregate to ordinary component traversal.
Teaches layer-by-layer shortest transitions from several starting points.
Optional introduction to weighted shortest paths after BFS is comfortable.
Question pages let you record local completion. Account status, confidence, notes, and a topic roll-up are shown only when private account persistence is available.
Open practice workspaceExplore decision trees systematically and prune invalid partial work.
Open the roadmap