Problem: Sliding Window Maximum

Statement

Given an array of integers nums and an integer k representing the size of a sliding window, the window starts at the leftmost position of the array and moves one position to the right at each step until it reaches the rightmost position. At each position, the window covers exactly k consecutive elements.

Return an array containing the maximum value within the sliding window at each position.

Note: The result array will have exactly nums.length $- k + 1$ elements, one for each valid window position.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$ ...