Stack
When talking about Data Structures and algorithms associated with them, we need to talk about Stacks. A stack is a linear data structure, which follows a particular order in which operations can be performed. These operations may be FILO (First In Last Out) or LIFO(Last In First Out).
Stacks can be implemented using arrays and linked lists manually, while languages like C++, Java, and Python have built-in classes, STLs, and libraries to implement them.
In this category, we will look into all operations and problems related to Stacks.
Top Problems related to Stack
Reverse string Word Wise

Sort a Stack

String Palindrome

Insert Interval

Water Droplet Mixing

Remove Consecutive Duplicates From String

Maximum in Subarrays of length K
Connect N Ropes With Minimum Cost

Reverse Stack Using Recursion
LRU Cache Implementation
Next Greater Element
Decode String
Minimum Depth Of Binary Tree

Sliding Maximum

First Negative In Every Window

Break Number

Diagonal Sum

Odd even level

Valid Parentheses
Stack using queue
Deepest Leaves Sum
