Sliding Window Maximum

Question Explain

Given an array `nums` and a sliding window size $k$, find the maximum number in each window. Use a Deque (Double-Ended Queue) for an $O(n)$ solution.