Maximum Subarray

Medium Greedy

Find the contiguous subarray with the largest sum.

Full statement, examples and constraints: see the original problem link below.

A full in-site walkthrough for this problem is coming soon.

Write your solution in the editor, then hit “Mark solved”. In-browser run & auto-check is coming soon.