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