Stack: Given an expression, get the minimum bracket reversal to make the expression balanced
Problem Statement: You are given an expression with “{” and “}” and might be balanced. Find the minimum number of…
Stack: Delete middle element of a stack
Problem Statement: Given a stack, you need to delete the middle element. You should not use any additional data structure. Example: Input: [1,…
Stack: Delete consecutive same words in a sequence
Problem Statement: You are given a array of strings. You need to find the number of words after pairwise deletion. Example: Input: arr[] =…
Stack: Given a string with balanced brackets, you need to print the bracket number
Problem Statement: You are given a sting s, containing bracket and character. You need to find the bracket number for each bracket in the…
Stack: Given 2 arrays, check if an array is stack permutation of another
Problem Statement: You are given 2 array of same size and the elements are unique. You need to check if a[] is a stack permutation of b[]. You…
Stack: Stock Span Problem
Problem Statement: You are given an array, that represents the stock of the ith day. You need to return the stock span for the ith day, i.e…
Stack: Given a string expression, check if it is balanced expression
Problem Statement: You are given a string that has braces of types “{ }”, “[ ]”, “( )”. In some places it…
Stack: Merge and sort 2 unsorted array
Problem Statement: Merge and sort 2 unsorted array Example: Input: s1 = {4, 3, 2} s2 = {7, 6} Output: {2, 3, 4, 6, 7} Solution : Take a temp…
Stack: Check if valid parentheses in an expression
Problem Statement: Given a string “s” contains various types of brackets. You need to check if the brackets are balanced or not.…
Stack: Check if concatenation of two strings is balanced or not
Problem Statement: You are given 2 bracket sequence S1 and S2. You need to check if the string obtained by concatenating both sequence is…