Hard Problems on Stack Data Structures
- The Celebrity Problem
- Print next greater number of Q queries
- Iterative Postorder Traversal | Set 2 (Using One Stack)
- Print ancestors of a given binary tree node without recursion
- Length of the longest valid substring
- Expression contains redundant bracket or not
- Find if an expression has duplicate parenthesis or not
- Find next Smaller of next Greater in an array
- Iterative method to find ancestors of a given binary tree
- Stack Permutations (Check if an array is stack permutation of other)
- Spaghetti Stack
- Remove brackets from an algebraic string containing + and – operators
- Range Queries for Longest Correct Bracket Subsequence
Quick Links :
- ‘Practice Problems’ on Stack
- ‘Videos’ on Stack
- ‘Quizzes’ on Stack
Recommended:
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