ProDeveloperTutorialonJanuary 19, 2025 Evaluate postfix expression Problem Statement: You are given an postfix expression, you need to evaluate that expression. Postfix expressions are in the form of a b op.…
ProDeveloperTutorialonJanuary 19, 2025 Stack: Next Greater Element Problem Statement: you are given an array, you need to get the next greater element for every element in the array. The next greater element…
ProDeveloperTutorialonJanuary 19, 2025 Stack: Check for balanced brackets using stack Problem Statement: Given a string that has parenthesis. You need to check if it is balanced or not. Example Input: exp = “[()]{}{[()()]()}”…
ProDeveloperTutorialonJanuary 19, 2025 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…
ProDeveloperTutorialonJanuary 19, 2025 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…
ProDeveloperTutorialonJanuary 19, 2025 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…
ProDeveloperTutorialonJanuary 19, 2025 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:…
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…