Word Search: Given an m x n grid of characters board and a string word, return true if word exists in the grid.
read moreWord Search: Given an m x n grid of characters board and a string word, return true if word exists in the grid.
read moreCombination Sum III: Find all valid combinations of k numbers that sum up to n such that the following conditions are true:
read moreCombination Sum II: 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.
read moreCombination Sum: 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.
read moreCombinations: Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n].
read morePermutations II: Given a collection of numbers, nums, that might contain duplicates, return *all possible unique permutations in any order*.
read moreDon’t settle for anything less than the crown. Join our newsletter and become the King of Interviews! Click here to join now and get the latest updates.