Nearest Smaller Elements | Monotonic Stack Part 1 | Stack | Array | JAVA

All nearest smaller values problem is the following task: for each position in a sequence of numbers, search among the previous positions for the last position that contains a smaller value. Here, I will show how to use a monotonic stack to solve problems such as this one. A monotonic stack is a stack whose elements are monotonically increasing or decreasing. It contains all qualities that a typical stack has and its elements are all monotonic decreasing or increasing. Sometimes we store the index of the elements in the stack and make sure the elements corresponding to those indexes in the stack forms a mono-sequence.

Part 1. Nearest Smaller Elements | Nearest Smaller Values | Nearest Smaller Elements on the Left

# Monotonic Stack

## Part 1. Nearest Smaller Elements

## Part 2. LeetCode 1475. Final Prices With a Special Discount in a Shop

## Part 3. LeetCode 739. Daily Temperatures

## Part 4. LeetCode 84. Largest Rectangle in Histogram