Stack&Queue Problems

Stacks (LIFO) and queues (FIFO) are essential for parsing, scheduling, and monotonic patterns. Practice balanced parentheses, next-greater-element, and BFS implementations.

21 problems

Title	Difficulty	Platform
Backspace String Compare	Easy	LeetCode
Daily Temperatures	Medium	LeetCode
Distance of nearest cell having 1 \| Practice	Medium	GeeksforGeeks
Evaluate Reverse Polish Notation	Medium	LeetCode
Evaluation of Postfix Expression	Easy	GeeksforGeeks
Flatten Nested List Iterator	Medium	LeetCode
Gas Station \| Practice	Medium	GeeksforGeeks
https://leetcode.com/problems/implement-stack-using-queues	Medium	LeetCode
Implement Queue using Stacks	Easy	LeetCode
Implement Stack and Queue using Deque	Easy	GeeksforGeeks
Implement Stack using Queues	Easy	LeetCode
Implement two Stacks in an Array	Easy	GeeksforGeeks
Letter Combinations of a Phone Number	Medium	LeetCode
LRU Cache – Complete Tutorial	Hard	GeeksforGeeks
Maximum of minimums of every window size in a given array	Hard	GeeksforGeeks
Minimum Cost Tree From Leaf Values	Medium	LeetCode
Next Greater Element I	Easy	LeetCode
Online Stock Span	Medium	LeetCode
Rotten Oranges \| Practice	Medium	GeeksforGeeks
Sum of Subarray Minimums	Medium	LeetCode
The Celebrity Problem	Hard	GeeksforGeeks