Leetcode 797. All Paths From Source to Target

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 797. All Paths From Source to Target

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact