28 docs tagged with "Backtracking"

solution to the leetcode problem beautiful arrrangement.

This is a solution to the Binary Watch problem on LeetCode.

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.

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.

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

Problem Description

This is a solution to the Generate Parentheses problem on LeetCode.

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

This is a solution to the Longest Subsequence Repeated k Times problem on LeetCode.

This is a solution to the Matchsticks to Square problem on LeetCode.

This is a solution to the 2002. Maximum Product of the Length of Two Palindromic Subsequences problem on LeetCode.

Problem Description

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.

This document explores finding the number of paths to reach the origin (0, 0) on a grid.

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

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

This document provides a solution to the Remove Invalid Parentheses

Problem Description

This is a solution to the Split a String Into the Max Number of Unique Substrings problem on LeetCode.

Problem Description

This is a solution to the Subsets problem on LeetCode.

Problem Description

Find the number of unique paths from the starting square to the ending square in a grid, walking over every non-obstacle square exactly once.

This document provides solutions for the Word Break II problem.

This is a solution to the word ladder II problem on LeetCode.

This is a solution to the word ladder problem on LeetCode.

This document provides a solution to the Word Search II problem, where we need to return all words on the board, given an mXn board of characters and a list of strings words.

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