Medium Problems on Stack Data Structures
- How to create mergable stack?
- The Stock Span Problem
- Next Greater Element
- Next Greater Frequency Element
- Maximum product of indexes of next greater on left and right
- Iterative Tower of Hanoi
- Sort a stack using a temporary stack
- Reverse a stack without using extra space in O(n)
- Delete middle element of a stack
- Check if a queue can be sorted into another queue using a stack
- Check if an array is stack sortable
- Iterative Postorder Traversal | Set 1 (Using Two Stacks)
- Largest Rectangular Area in a Histogram | Set 2
- Find maximum of minimum for every window size in a given array
- Find index of closing bracket for a given opening bracket in an expression
- Find maximum difference between nearest left and right smaller elements
- Delete consecutive same words in a sequence
- Check mirror in n-ary tree
- Reverse a number using stack
- Reversing the first K elements of a Queue
Stack Data Structure
A Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first, comes out last.
Table of Content
- What is Stack Data Structure?
- Basic Operations of Stack Data Structures
- Applications of Stack Data Structures
- Basics of Stack Data Structure
- Implementations of Stack in Different Languages
- Other Implementations of Stack Data Structures
- Easy Problems on Stack Data Structures
- Medium Problems on Stack Data Structures
- Hard Problems on Stack Data Structures
Contact Us