Sliding Window Maximum

You are given an array of integers `nums`, there is a sliding window of size `k` which is moving from the very left of the array to the very right. You can only see the `k` numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window as space-separated integers. ### Constraints - `1 <= nums.length <= 10^5` - `-10^4 <= nums[i] <= 10^4` - `1 <= k <= nums.length` ### Input Format First line contains two integers `n` and `k`. Second line contains space-separated integers representing `nums`. ### Output Format Print the space-separated integers representing the maximum in each sliding window.