Search for a command to run...
Articles tagged with #backtracking
You are given a 2D grid representing a maze where: 'S' represents the starting point, 'E' represents the ending point, '0' represents open paths, and '1' represents walls. You need to find all possible paths from 'S' to 'E' using backtracking. ...
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 an integer n, return the number of distinct solutions to the n-queens puzzle. Example 1: Input: n = 4 Output: 2 Explanatio...
Explain the Problem Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example: Input: nums = [1,2,2] Output: [ ...
Explain the Problem Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. Example: Input: s = "aab" Output: 1 Explanation: The palindrome partition...
Explain the Problem Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers. All numbers will be positive integers, and no duplicate...
Explain the Problem Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order. Example: Input: s = "catsanddog", wordDict...
