Stack: Sort a stack using recursion
Problem Statement: Sort a stack using recursion. Solution Explanation: Remove the top element, recursively sort the remaining elements. Take a…
Stack: Sort a stack using a temporary stack
Problem Statement: You are given integers in a stack. You need to sort it in ascending order using another stack. Example: Input: [5, 3, 4, 2,…
Stack: Reversing the first K elements of a Queue
Problem Statement: You are given a queue and integer k. Your task is to reverse the order of the first k element of the queue. Leaving the…
Stack: Print Bracket Number
Problem Statement: You are given expression, you need to print the bracket numbers Example: (a + (b*c)) 1221 Solution: Create a variable…
Stack: Given an array, you need to find the previous greater element
Problem Statement: Given an array of distinct elements, you need to find the previous greater element. If there is no greater element, return…
Stack: Nearest smaller numbers on left side in an array
Problem Statement: Given an array, you need to find the nearest smaller number for every element on its left side. Example: Input : [1, 6, 0,…
Stack: Prefix to postfix conversion
Problem Statement: Prefix expression: *+AB-CD is a prefix expression. Postfix expression: AB+CD-* Solution Explanation: Read the prefix…
Stack: Prefix to infix conversion
Problem Statement: Prefix expression: *+AB-CD is a prefix expression. Infix expression: ((A+B)*(C-D)) is an Infix expression Solution…
Stack: Postfix and prefix conversion
Problem Statement: Postfix expression: AB+CD-* is an postfix expression Prefix expression: *+AB-CD is a prefix expression. Solution…
Stack: Convert Infix to Postfix Expression
Problem Statement: Infix expression: a + b is a infix expression. Postfix expression: ab+ is an postfix expression Example: A * (B + C)/D…