# Monotonic stack

## What is a Monotonic Stack

A monotonic stack is a stack whose elements are monotonically increasing or decreasing. It contains all properties that a typical stack has and its elements are monotonic decreasing or increasing.

Monotonic increasing stack: [2 3 5 6 9]

Monotonic decreasing stack: [9 6 5 3 2]

## [Leetcode 739] Daily Temperatures

Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.

Example 1:

1 | Input: temperatures = [73,74,75,71,69,72,76,73] |

Constraints:

- 1 <= temperatures.length <= 105
- 30 <= temperatures[i] <= 100

Solution:

1 | class Solution: |

## [Leetcode 901] Online Stock Span

Design an algorithm that collects daily price quotes for some stock and returns the span of that stock’s price for the current day.

The span of the stock’s price in one day is the maximum number of consecutive days (starting from that day and going backward) for which the stock price was less than or equal to the price of that day.

- For example, if the prices of the stock in the last four days is [7,2,1,2] and the price of the stock today is 2, then the span of today is 4 because starting from today, the price of the stock was less than or equal 2 for 4 consecutive days.
- Also, if the prices of the stock in the last four days is [7,34,1,2] and the price of the stock today is 8, then the span of today is 3 because starting from today, the price of the stock was less than or equal 8 for 3 consecutive days.

Implement the StockSpanner class:

- StockSpanner() Initializes the object of the class.
- int next(int price) Returns the span of the stock’s price given that today’s price is price.

Example 1:

1 | Input |

Constraints:

- 1 <= price <= 105
- At most 104 calls will be made to next.

Solution:

1 | class StockSpanner: |