Maximum subarray sum of an array repeated k times
Write an integer array out k times back to back and return the largest sum of a non-empty contiguous subarray of the result. Do it without building the repeated array, and explain why at most two copies plus the total sum decide the answer.
MicrosoftCodingNo answer yet. Write the first one; the best answer gets endorsed.