# Sliding Window Maximum (LC5420)
## Problem
Return max of each contiguous window of size k in an array.
## Approach
Monotonic deque storing indices decreasing by value. Pop back while smaller; pop front out of window; front is max.
## Complexity
O(n).
## Practice
Deque window tricks are classic OA fodder — [www.linkjob.ai](https://www.linkjob.ai/).
## Notes
- Store indices not values
- Strict vs non-strict
- k=1 / k=n edges