Easy | Max stack | Problem Statement The problem “Max stack” states to design a special stack which can read more |

Easy | Find Index of Closing Bracket for a Given Opening Bracket in an Expression | Problem Statement Given a string s of length/size n and an integer value representing the index of read more |

Easy | Design a stack that supports getMin() in O(1) time and O(1) extra space | Design a stack that supports getMin() in O(1) time and O(1) extra space. Thus the special stack read more |

Easy | Sort a stack using recursion | Problem Statement The problem “Sort a stack using recursion” states that you are given read more |

Easy | Delete middle element of a stack | Problem Statement Given a data structure (stack). Write a program to delete the middle element of read more |

Easy | Sorting array using Stacks | Problem statement The problem “Sorting array using Stacks” states that you are given a read more |

Easy | Sort a stack using a temporary stack | Problem Statement The problem “Sort a stack using a temporary stack” states that you read more |

Easy | Reverse a stack without using extra space in O(n) | Problem Statement The problem “Reverse a stack without using extra space in O(n)” read more |

Easy | Bubble sort using two Stacks | Problem Statement The problem “Bubble sort using two Stacks” states that you are given read more |

Medium | Count subarrays where second highest lie before highest | Problem Statement The problem “Count subarrays where second highest lie before highest” read more |

Easy | Find maximum difference between nearest left and right smaller elements | Problem Statement Given an array a[ ] of size n. The problem “Find maximum difference between read more |

Easy | Remove brackets from an algebraic string containing + and – operators | Problem Statement You are given a string s of size n representing an arithmetic expression with read more |

Easy | Implement a stack using single queue | Problem Statement The problem “Implement a stack using single queue” asks us to read more |

Easy | Form Minimum Number From Given Sequence | Problem Statement The problem “Form Minimum Number From Given Sequence states that you are read more |

Pattern Occurrences using Stack | Problem Statement Given two arrays pattern[ ] and text[ ] of character type. The problem read more | |

Easy | Iterative Postorder Traversal Using Two Stacks | Problem Statement The problem “Iterative Postorder Traversal Using Two Stacks” states read more |

Easy | Stack Permutations (Check if an array is stack permutation of other) | Problem Statement The problem “Stack Permutations (Check if an array is stack permutation of read more |

Easy | Growable array based stack | Problem Statement Growable array-based stack is used in cases of “stack full”. Here the read more |

Tracking current Maximum Element in a Stack | Problem Statement “Tracking current Maximum Element in a Stack” states that you are read more | |

Easy | Iterative method to find ancestors of a given binary tree | Problem Statement “Iterative method to find ancestors of a given binary tree” problem read more |

Easy | Check if stack elements are pairwise consecutive | Problem Statement “Check if stack elements are pairwise consecutive” problem states read more |

Identify and Mark Unmatched Parenthesis in an Expression | In identify and mark unmatched parenthesis in an expression problem, we have given a string s of read more | |

Minimum Bracket Reversals | In minimum bracket reversals problem, we have given a string s containing an expression of read more | |

Reverse a Number Using Stack | In reverse a number using stack problem we have given an integer variable representing a number. read more | |

Check if Two Expressions With Brackets are Same | Given two strings s1 and s2 representing expressions containing addition operator, subtraction read more | |

Min Stack | In min stack problem we have to design a stack to implement the following functions efficiently, read more | |

Implement Stack using Queues | Implement the following functions of stack data structure using standard operations of queue, read more | |

Arithmetic Expression Evaluation | We write Arithmetic expressions in following three notations – Prefix Notation In this read more | |

Maximum Product of Indexes of Next Greater on Left and Right | Given an array a[ ] of size n. For each element at position, i find the L[i] and R[i] where – read more | |

Check for Balanced Parentheses in an Expression | Given a string s of length n. Check whether there is a closing parenthesis for every opening read more | |

Evaluation of Postfix Expression | In the Evaluation of the postfix expression problem, we have given a string s containing a postfix read more | |

Reverse a Stack Using Recursion | In reverse a stack using recursion problem, we have given a stack data structure. Reverse its read more | |

Find if an Expression has Duplicate Parenthesis or Not | Given a string containing balanced parenthesis. Find if the expression/string contains duplicate read more | |

How to Implement Stack Using Priority Queue or Heap? | Implement a stack with the help of a priority queue or a heap. Priority Queue : Priority queue data read more | |

Iterative Tower of Hanoi | Tower of Hanoi is a mathematical puzzle. In this puzzle, we are required to shift all the disks read more | |

How to Efficiently Implement k Stacks in a Single Array? | Design and implement a new data structure that Implement k Stacks in a Single Array. The new data read more | |

Find Maximum Depth of Nested Parenthesis in a String | Given a string s. Write the code to print the maximum depth of nested parenthesis in the given read more | |

Expression Evaluation | In expression evaluation problem, we have given a string s of length n representing an expression read more | |

How to Create Mergable Stack? | We have to design and create a stack that performs the operations in constant time. Here we have read more | |

The Stock Span Problem | This problem “The Stock Span Problem” comes under the financial aspect. In this read more | |

Find Maximum Sum Possible Equal Sum of Three Stacks | Given 3 arrays stack1[ ], stack2[ ] and stack3[ ] representing stacks and the starting index of read more | |

Print Next Greater Number of Q queries | In Print Next Greater Number of Q queries problem we have given an array a[ ] of size n containing read more | |

Check if an Array is Stack Sortable | In check if an array is stack sortable problem we have given an array a[ ] of size n containing read more | |

Reverse a String using Stack | We have given a string s of length n which contains lower case letters, upper case letters, read more | |

Number of NGEs to the Right | In the Number of NGEs to the right problem we have given an array a[ ] of size n and q number of read more | |

Balanced Expression with Replacement | In Balanced Expression with Replacement problem we have given a string s containing parenthesis read more | |

Decode String | Suppose, you are given an encoded string. A string is encoded in some kind of pattern, your task is read more | |

Recursion | What is Recursion? Recursion is simply defined as a function calling itself. It uses its previously read more | |

Prefix to Infix Conversion | In prefix to infix conversion problem, we have given expression in prefix notation. Write a program read more | |

Postfix to Infix Conversion | In postfix to infix conversion problem, we have given expression in postfix notation. Write a read more | |

Prefix to Postfix Conversion | In prefix to postfix conversion problem, we have given expression in prefix notation in string read more | |

Postfix to Prefix Conversion | In this problem, we have given a string that denotes the postfix expression. We have to do postfix read more | |

Backspace String Compare | In the backspace string compare problem we have given two Strings S and T, check if they are equal read more |