← Questions
Maximum subarray sum of an array repeated k times
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
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