Add solution #797

Author: JoshCrozier

README.md

@@ -607,6 +607,7 @@
 794|[Valid Tic-Tac-Toe State](./0794-valid-tic-tac-toe-state.js)|Medium|
 795|[Number of Subarrays with Bounded Maximum](./0795-number-of-subarrays-with-bounded-maximum.js)|Medium|
 796|[Rotate String](./0796-rotate-string.js)|Easy|
+797|[All Paths From Source to Target](./0797-all-paths-from-source-to-target.js)|Medium|
 802|[Find Eventual Safe States](./0802-find-eventual-safe-states.js)|Medium|
 804|[Unique Morse Code Words](./0804-unique-morse-code-words.js)|Easy|
 819|[Most Common Word](./0819-most-common-word.js)|Easy|

solutions/0797-all-paths-from-source-to-target.js

@@ -0,0 +1,36 @@
+/**
+ * 797. All Paths From Source to Target
+ * https://leetcode.com/problems/all-paths-from-source-to-target/
+ * Difficulty: Medium
+ *
+ * Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths
+ * from node 0 to node n - 1 and return them in any order.
+ *
+ * The graph is given as follows: graph[i] is a list of all nodes you can visit from node i (i.e.,
+ * there is a directed edge from node i to node graph[i][j]).
+ */
+
+/**
+ * @param {number[][]} graph
+ * @return {number[][]}
+ */
+var allPathsSourceTarget = function(graph) {
+  const target = graph.length - 1;
+  const paths = [];
+
+  const dfs = (node, path) => {
+    if (node === target) {
+      paths.push([...path]);
+      return;
+    }
+
+    for (const neighbor of graph[node]) {
+      path.push(neighbor);
+      dfs(neighbor, path);
+      path.pop();
+    }
+  };
+
+  dfs(0, [0]);
+  return paths;
+};