← Questions
Maximum sum of a length-k subarray
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Use a sliding window to find the largest sum of any contiguous subarray of length k, and explain its time and space. The same round followed with a heap problem.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding