Stack Problems – DSA

Filter by difficulty:

Implementation

•

Implement a stack using linked list Easy

Solution

•

Implement a stack using a queue Easy

Solution

•

Implement Min / Max stack with O(1) Easy

Solution

•

Implement K stacks in a single array Hard

Solution

•

Maximum rectangular area in histogram Hard

Solution

Expressions

•

Infix to Prefix Medium

Solution not available

•

Infix to Postfix Medium

Solution not available

•

Prefix to Postfix Medium

Solution not available

•

Prefix to Infix Medium

Solution not available

•

Postfix to Prefix Medium

Solution not available

•

Postfix to Infix Medium

Solution not available

•

Check valid parenthesis with * wildcard Medium

Solution

•

Longest valid parenthesis length Hard

Solution

•

Evaluate Reverse Polish Notation (RPN) Medium

Solution

•

Evaluate calculator (+, -, (, )) Hard

Solution

•

Evaluate calculator (+, -, *, /) Medium

Solution

•

Evaluate calculator (+, -, *, /, (, )) Hard

Solution

Monotonic Stack & Applications

•

Max width pair (i < j and nums[i] ≤ nums[j]) Medium

Solution

•

Next greater / smaller element in an array Easy

Solution

•

Next Greater Element I Easy

Solution

•

Next Greater Element II (circular array) Medium

Solution

•

Max of min for every window size Hard

Solution

•

Stock Span Problem Medium

Solution