Other Implementations of Stack Data Structures
- Implement Queue using Stacks
- Design and Implement Special Stack Data Structure | Added Space Optimized Version
- Implement two stacks in an array
- Implement Stack using Queues
- 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
- Implement a stack using single queue
- How to implement stack using priority queue or heap?
- Create a customized data structure which evaluates functions in O(1)
- Implement Stack and Queue using Deque
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