Problem 1191 · Medium

K-Concatenation Maximum Sum

Find the largest subarray sum in an array repeated k times, where the empty subarray counts as zero. The visual contrasts the single-copy result with the best sum that crosses copy boundaries.

Open the interactive visualisation