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 Subarray Sum > Editorial

Maximum Subarray Sum — Solution & Editorial

Back to the Problem

Kadane's algorithm: the best subarray ending at i either extends the previous best or restarts at ai. Track the global maximum.

Complexity: O(N)

Watch out: All-negative inputs: the answer is the largest single element, so never clamp the running sum at 0.