Depth First Search

Note that if a graph is acyclic, we don't need to keep a set of visited nodes to prevent going into a loop.

Example: 797. All Paths From Source to Target (Medium)

Problems

• 17. Letter Combinations of a Phone Number (Medium)

• 39. Combination Sum (Medium)

• 40. Combination Sum II (Medium)

• 77. Combinations (Medium)

• 212. Word Search II (Hard)

• 216. Combination Sum III (Medium)

• 797. All Paths From Source to Target (Medium)

• 1219. Path with Maximum Gold (Medium)

• 1601. Maximum Number of Achievable Transfer Requests (Hard)