Problem - Sliding Window Maximum

Given an integer array $nums$ and an integer $k$, return the maximum element in each sliding window of size $k$. You're solving the textbook monotonic deque problem.

The solution is $O(n)$ because each element is added to and removed from the deque at most once. Read the problem. Constraints are up to $10^5$ elements.