Solution: All Paths From Source to Target

Explore how to implement depth-first search combined with backtracking to find every possible path from a source node to a target node in a directed acyclic graph. Understand recursive traversal, path tracking, and backtracking techniques useful for coding interviews.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given a directed acyclic graph (DAG) with $n$ nodes, labeled from $0$ to $n - 1$ . The graph is represented as an adjacency list, where graph[i] is a list of all nodes to which node i has a directed edge to.

Your task is to find all possible paths from node $0$ (the source) to node $n - 1$ (the target) and return them as a list of paths. Each path should be represented as a list of node indexes.

Note: You may return the answer in any order.

Constraints:

$2 \leq$ ...