Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Maximum Circular Subarray > Editorial

Maximum Circular Subarray — Solution & Editorial

Back to the Problem

A wrapping subarray is the complement of a normal one: its sum is total − (minimum subarray). Answer = max(normal Kadane, total − min-Kadane), except when the min subarray is the whole array (all negatives) — then the plain Kadane answer stands.

Complexity: O(N)

Watch out: The all-negative case: total − min would pick an empty wrap — exclude it explicitly.