ProDeveloperTutorialonJanuary 19, 2025 Backtracking: Return the number of queens possible in a chessboard Problem Statement: You are given an n * n chessboard, you need to return the number of queens possible in the chess board. Example n = 4…
ProDeveloperTutorialonJanuary 19, 2025 Backtracking: Get the sequential digits from the given range Problem Statement: You are given 2 values, low, high. You need to find the sequential digits, where one number is more than the previous…
ProDeveloperTutorialonJanuary 19, 2025 Backtracking: Letter case permutation Problem Statement: You are given a string, you need to transform every letter individually to be lowercase or uppercase to create another…
ProDeveloperTutorialonJanuary 19, 2025 Backtracking: Find combination sum of k numbers that sum up to n Problem Statement: You are given two numbers K and N, you need to find all valid combinations of k numbers that sum up to n. Such that only…
ProDeveloperTutorialonJanuary 19, 2025 Backtracking: Get the k combination from an array of 1 to n Problem Statement: You are given 2 integers n and k, you need to return all possible combination of K numbers from the range [1, n] Example…
ProDeveloperTutorialonJanuary 19, 2025 Backtracking: You are given an array with repeated elements and a key element, find all unique combination to the key Problem Statement: You are given an array with repeated elements, and a key element. You need to return the unique combination in that array…
ProDeveloperTutorialonJanuary 19, 2025 Backtracking: Partition string into its palindrome Problem Statement: You are given a string. You need to partition the string in such a way that, each substring is a palindrome. Example Input:…
ProDeveloperTutorialonJanuary 19, 2025 Greedy: Find maximum sum possible equal sum of three stacks Problem Statement: You are given 3 arrays that represents a stack. You need to remove the top elements of the stack such that the sum of all…
ProDeveloperTutorialonJanuary 19, 2025 Greedy: Connect ropes with minimum cost. Problem Statement: You are given n ropes of different length. You need to connect these ropes into one rope. The cost of connecting two ropes…
ProDeveloperTutorialonJanuary 19, 2025 Greedy: String break problem Problem Statement: You are given 2 string and you need to check if some permutation of s1 can break s2 or vice-versa. A string can break…