Problem 918 · Medium

Maximum Sum Circular Subarray

Find the greatest sum of a nonempty run of values on a circular array, where a run may wrap past the end. The visual draws a ring with a highlighted arc and compares it with the complement arc.

Open the interactive visualisation