# DFS

- [backtracking tips](/cracking-leetcode/dfs-and-bfs/dfs/tips.md)
- [46. Permutations - example](/cracking-leetcode/dfs-and-bfs/dfs/tips/46.-permutations-example.md)
- [47. Permutations II (i = 0, sort, used](/cracking-leetcode/dfs-and-bfs/dfs/tips/47.-permutations-ii.md)
- [Page 9](/cracking-leetcode/dfs-and-bfs/dfs/tips/page-9.md)
- [39. Combination Sum (not use befroe, so int I = start, dfs(i) -> is i !!](/cracking-leetcode/dfs-and-bfs/dfs/tips/39.-combination-sum.md)
- [78. Subsets (not use befroe, so int I = start, dfs(i+1)](/cracking-leetcode/dfs-and-bfs/dfs/tips/78.-subsets.md)
- [77. Combinations (not use before, so int I = start, dfs(i+1](/cracking-leetcode/dfs-and-bfs/dfs/tips/77.-combinations.md)
- [90. Subsets II (not use before so int I = start, dfs(i+1), and sort](/cracking-leetcode/dfs-and-bfs/dfs/tips/90.-subsets-ii-not-use-before-so-int-i-start-dfs-i+1-and-sort.md)
- [40. Combination Sum II (not use before so int I = start, dfs(i+1), and sort](/cracking-leetcode/dfs-and-bfs/dfs/tips/40.-combination-sum-ii-not-use-before-so-int-i-start-dfs-i+1-and-sort.md)
- [17. Letter Combinations of a Phone Number](/cracking-leetcode/dfs-and-bfs/dfs/tips/17.-letter-combinations-of-a-phone-number.md)
- [37. Sudoku Solver](/cracking-leetcode/dfs-and-bfs/dfs/tips/37.-sudoku-solver.md)
- [51. N-Queens](/cracking-leetcode/dfs-and-bfs/dfs/tips/51.-n-queens.md)
- [52. N-Queens II](/cracking-leetcode/dfs-and-bfs/dfs/tips/52.-n-queens-ii.md)
- [60. Permutation Sequence](/cracking-leetcode/dfs-and-bfs/dfs/tips/60.-permutation-sequence.md)
- [79. Word Search (backtracking)](/cracking-leetcode/dfs-and-bfs/dfs/tips/79.-word-search.md)
- [212. Word Search II (backtracking)](/cracking-leetcode/dfs-and-bfs/dfs/tips/212.-word-search-ii-backtracking.md)
- [113. Path Sum II](/cracking-leetcode/dfs-and-bfs/dfs/tips/113.-path-sum-ii.md)
- [282. Expression Add Operators](/cracking-leetcode/dfs-and-bfs/dfs/tips/282.-expression-add-operators.md)
- [301. Remove Invalid Parentheses](/cracking-leetcode/dfs-and-bfs/dfs/tips/301.-remove-invalid-parentheses.md)
- [399. Evaluate Division (backtracking](/cracking-leetcode/dfs-and-bfs/dfs/tips/399.-evaluate-division-backtracking.md)
- [489. Robot Room Cleaner](/cracking-leetcode/dfs-and-bfs/dfs/tips/489.-robot-room-cleaner.md)
- [465. Optimal Account Balancing](/cracking-leetcode/dfs-and-bfs/dfs/tips/465.-optimal-account-balancing.md)
- [996. Number of Squareful Arrays](/cracking-leetcode/dfs-and-bfs/dfs/tips/996.-number-of-squareful-arrays.md)
- [1568. Minimum Number of Days to Disconnect Island](/cracking-leetcode/dfs-and-bfs/dfs/tips/1568.-minimum-number-of-days-to-disconnect-island.md)
- [2065. Maximum Path Quality of a Graph](/cracking-leetcode/dfs-and-bfs/dfs/tips/2065.-maximum-path-quality-of-a-graph.md)
- [1306. Jump Game III](/cracking-leetcode/dfs-and-bfs/dfs/tips/1306.-jump-game-iii.md)
- [dispatch to k subsets or ? subsets](/cracking-leetcode/dfs-and-bfs/dfs/tips/dispatch-to-k-subsets-or-subsets.md)
- [473. Matchsticks to Square](/cracking-leetcode/dfs-and-bfs/dfs/tips/dispatch-to-k-subsets-or-subsets/473.-matchsticks-to-square.md)
- [698. Partition to K Equal Sum Subsets](/cracking-leetcode/dfs-and-bfs/dfs/tips/dispatch-to-k-subsets-or-subsets/698.-partition-to-k-equal-sum-subsets.md)
- [1986. Minimum Number of Work Sessions to Finish the Tasks](/cracking-leetcode/dfs-and-bfs/dfs/tips/dispatch-to-k-subsets-or-subsets/1986.-minimum-number-of-work-sessions-to-finish-the-tasks.md)
- [1723. Find Minimum Time to Finish All Jobs](/cracking-leetcode/dfs-and-bfs/dfs/tips/dispatch-to-k-subsets-or-subsets/1723.-find-minimum-time-to-finish-all-jobs.md)
- [279. Perfect Squares](/cracking-leetcode/dfs-and-bfs/dfs/279.-perfect-squares.md)
- [241. Different Ways to Add Parentheses](/cracking-leetcode/dfs-and-bfs/dfs/241.-different-ways-to-add-parentheses.md)
- [417. Pacific Atlantic Water Flow](/cracking-leetcode/dfs-and-bfs/dfs/417.-pacific-atlantic-water-flow.md)
- [200. Number of Islands](/cracking-leetcode/dfs-and-bfs/dfs/200.-number-of-islands.md)
- [959. Regions Cut By Slashes (in the end use 200)](/cracking-leetcode/dfs-and-bfs/dfs/959.-regions-cut-by-slashes-in-the-end-use-200.md)
- [1905. Count Sub Islands](/cracking-leetcode/dfs-and-bfs/dfs/1905.-count-sub-islands.md)
- [1162. As Far from Land as Possible](/cracking-leetcode/dfs-and-bfs/dfs/1162.-as-far-from-land-as-possible.md)
- [1162 compare to 317](/cracking-leetcode/dfs-and-bfs/dfs/1162-compare-to-317.md)
- [22. Generate Parentheses](/cracking-leetcode/dfs-and-bfs/dfs/22.-generate-parentheses.md)
- [129. Sum Root to Leaf Numbers](/cracking-leetcode/dfs-and-bfs/dfs/129.-sum-root-to-leaf-numbers.md)
- [425. Word Squares](/cracking-leetcode/dfs-and-bfs/dfs/425.-word-squares.md)
- [694. Number of Distinct Islands](/cracking-leetcode/dfs-and-bfs/dfs/694.-number-of-distinct-islands.md)
- [1254. Number of Closed Islands](/cracking-leetcode/dfs-and-bfs/dfs/1254.-number-of-closed-islands.md)
- [1020. Number of Enclaves](/cracking-leetcode/dfs-and-bfs/dfs/1020.-number-of-enclaves.md)
- [419. Battleships in a Board](/cracking-leetcode/dfs-and-bfs/dfs/419.-battleships-in-a-board.md)
- [711. Number of Distinct Islands II](/cracking-leetcode/dfs-and-bfs/dfs/711.-number-of-distinct-islands-ii.md)
- [DFS with return value](/cracking-leetcode/dfs-and-bfs/dfs/dfs-with-return-value.md)
- [Copy of 129. Sum Root to Leaf Numbers](/cracking-leetcode/dfs-and-bfs/dfs/129.-sum-root-to-leaf-numbers-1.md)
- [2477. Minimum Fuel Cost to Report to the Capital](/cracking-leetcode/dfs-and-bfs/dfs/2477.-minimum-fuel-cost-to-report-to-the-capital.md)
- [2492. Minimum Score of a Path Between Two Cities](/cracking-leetcode/dfs-and-bfs/dfs/2492.-minimum-score-of-a-path-between-two-cities.md)