PYTHON PROBLEM 302 · Intermediate

Find an unweighted shortest path: Unreachable destination

Report when start and target lie in disconnected components.

shortest path · parent mapshortest pathparent map

PROBLEM OVERVIEW

What this Python exercise asks you to practise

This scenario tests find an unweighted shortest path. It belongs to the Graphs and Connectivity roadmap and uses the shortest path · parent map pattern.

Graph representation, BFS, DFS, shortest paths, topological order, and union-find.

COMPLETE WORKSPACE

Learn the plan, trace the logic and run the solution

Complete access unlocks the full statement, input and output examples, visual execution plan, hints, browser compiler, solution and line-by-line interpretation.

Unlock all 360 problems · ₹599One full year · one payment · no automatic renewal

SKILL TO CARRY FORWARD

Pattern relevance

This exercise strengthens shortest path · parent map. Be ready to explain the input, the rule, the boundary cases, and why the chosen approach is appropriate.