回溯

电话号码的字母组合

Generate all letter combinations a digit string can represent using backtracking with pruning, leveraging hash table map…

括号生成

Generate Parentheses requires generating all valid combinations of parentheses with given pairs using backtracking and s…

解数独

Solve the Sudoku puzzle by filling empty cells while respecting Sudoku's rules using array scanning and backtracking.

组合总和

Find all unique combinations of numbers from a distinct array that sum to a target using controlled backtracking search.

组合总和 II

Find all unique combinations of numbers that sum to a target using backtracking with careful pruning to avoid duplicates…

全排列

Generate all possible orderings of a distinct integer array using backtracking search with careful pruning to avoid dupl…

全排列 II

Generate all unique permutations of an array containing duplicates using backtracking and pruning to avoid repeated sequ…

N 皇后

Solve the N-Queens problem using backtracking with pruning, exploring all valid board placements while avoiding conflict…

N 皇后 II

Solve the N-Queens II problem using backtracking with pruning to efficiently count all valid placements for n queens on …

组合

Generate all combinations of k numbers from the range [1, n] using backtracking and pruning.

子集

Generate all subsets of a set of unique integers using backtracking with pruning to avoid duplicates.

单词搜索

Solve Word Search with backtracking by exploring adjacent cells to match a target word in a grid.

格雷编码

Generate an n-bit Gray Code sequence using backtracking with pruning and bit manipulation techniques.

子集 II

Subsets II problem asks to generate unique subsets from an array with possible duplicates using backtracking search with…

复原 IP 地址

Restore all valid IP addresses from a string using backtracking with pruning, avoiding invalid segments or leading zeros…

不同的二叉搜索树 II

Generate all structurally unique BSTs with values 1 to n using backtracking and recursive tree construction techniques.

路径总和 II

Find all root-to-leaf paths in a binary tree where the sum of node values equals a given target using DFS backtracking.

单词接龙 II

Find all shortest transformation sequences from beginWord to endWord using a dictionary, leveraging backtracking search …

分割回文串

Find all possible palindrome partitioning of a string using backtracking and dynamic programming.

单词拆分 II

Given a string and dictionary, return all possible sentences by adding spaces where each word is in the dictionary.

单词搜索 II

Solve the Word Search II problem using backtracking with pruning to find all words on a board of characters.

组合总和 III

Find all unique combinations of k numbers adding to n using efficient backtracking with pruning in arrays.

二叉树的所有路径

Find all root-to-leaf paths in a binary tree using DFS and backtracking, constructing strings for each complete path eff…

给表达式添加运算符

Expression Add Operators is solved with backtracking that builds multi-digit operands and tracks multiplication preceden…