Implement Stack using Queues
Problem Statement: You need to create stack data structure using only queue data structure. Solution As we know that for stack insertion and…
Stack: Expression contains redundant bracket or not
Problem Statement: You are given an expression in the form of a string. You need to check if the string has redundant brackets. Example Input:…
Stack: Length of the longest valid substring
Problem Statement: You are given a string, you need to find the length of longest valid parenthesis. Example Input : ((() Output : 2 Solution…
Largest Rectangular Area in a Histogram
Problem Statement: You are given an array that represents a bar in a histogram. You need to find out the largest rectangle that can be made…
Sort a stack
Problem Statement: You are given a stack, you need to sort it. Solution This problem can be solved in 2 different methods: 1. Sorting using…
Stack: Reverse a stack using recursion
Problem Statement: You are given a stack, you need to reverse the stack without using while, for. You need to reverse using recursion.…
Insert at the end of stack
Problem Statement: You are given an element, you need to insert it at the end of the stach without using any data structure. Solution Solution…
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.…
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…
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 = “[()]{}{[()()]()}”…