Given an array and window size k, return the maximum of each sliding window.
Input: nums=[1,3,-1,-3,5,3,6,7], k=3 Output: [3,3,5,5,6,7]
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features