Maximum sum of a length-k subarray
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.
AmazonCodingNo answer yet. Write the first one; the best answer gets endorsed.