Table of Contents
- Stack Data Structure
- Stack Data Structure (Introduction and Program)
- Applications, Advantages and Disadvantages of StackDesign and Implementations of Stack
- Queue using Stacks
- Design and Implement Special Stack Data Structure | Added Space Optimized Version
- Implement Stack using Queues
- Design a stack with operations on middle element
- How to efficiently implement k stacks in a single array?
- Design a stack that supports getMin() in O(1) time and O(1) extra space
- Create a customized data structure which evaluates functions in O(1)
- Implement a stack using single queue
Operations on Stack- Reverse a stack using recursion
- Sort a stack using recursion
- Sort a stack using a temporary stack
- Reverse a stack without using extra space in O(n)
- Delete middle element of a stack
- Sorting array using Stacks
- Check if a queue can be sorted into another queue using a stack
- Count subarrays where second highest lie before highest
- Delete array elements which are smaller than next or become smaller
Standard problems on Stack