Stack: Delete the middle element from the stack.
Problem Statement: You are given a stack, you need to delete the middle element from it. You should delete the middle element without using…
Implement two stacks in an array
Problem Statement: You need to create a data structure called two_stacks that represents 2 stacks. It should use only one array. Both stacks…
Backtracking: Get maximum sum in a matrix
Problem Statement: You are given an m*n matrix, each cell has an integer. You need to return the path with maximum sum. You can start at any…
Backtracking: Partition to K Equal Sum Subsets
Problem Statement: You are given an integer array and an integer K, you need to return true if you are able to divide the Example Input:…
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…
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…
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…
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…
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…
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…