Available question text
Given a directed graph and nodes source and destination, determine whether every possible path starting from source eventually ends at destination — i.e., no path terminates at a different node or gets stuck in a cycle. Ensure destination is a sink (no outgoing edges) and that all reachable paths from source lead to it.
Related questions
Continue with questions that share topics or the same question type.
- All Paths From Source to Target
Coding
- Reorder Routes to Make All Paths Lead to the City Zero
Coding
- Find All Possible Recipes from Given Supplies
Coding · Array · Directed Acyclic Graph · Graph Theory
- Find Maximum Removals From Source String
Coding
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
No company association
Leetcode 1059. All Paths from Source Lead to Destination
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source