15 docs tagged with "Backtracking"

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.

Find all valid combinations of k numbers that sum up to n such that the following conditions are true.

Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n].

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

Given a string s, you can transform every letter individually to be lowercase or uppercase to create another string.

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

Given an integer array nums of unique elements, return all possible subsets (the power set).

Given an integer array nums that may contain duplicates, return all possible subsets (the power set).

Write a program to solve a Sudoku puzzle by filling the empty cells.

Given an m x n grid of characters board and a string word, return true if word exists in the grid.