Problem 126 of 333HardCodingP126

Sliding window maximum

Given an array of length $n$ and window size $k$ , return the max in each contiguous window of size $k$ . $O(n)$ time.
See the hint and solution with a free account
Every problem on Quant Engine is free, with a hint and a full worked solution. Making an account takes 30 seconds and no card. Then you can see them and track what you have solved.
Create a free account Log in

See the hint and solution with a free account