Available question text
Given a DAG as adjacency lists, enumerate all possible paths from source node 0 to target node n−1 and return each path as a list of node indices. This is typically solved with DFS/backtracking on the DAG (n ≤ 15, so exponential output is acceptable).
Related questions
Continue with questions that share topics or the same question type.
- All Paths from Source Lead to Destination
Coding
- Find All Combinations of Bag Sizes That Sum to a Target Capacity
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
Bloomberg
Leetcode 797. All Paths From Source to Target
Reported Oct 28, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source