Skip to main content
Maximum Subarray | AlgoCracked
AlgoCracked
ProblemsMaximum Subarray
Medium50.0% acceptance
Blind75Dynamic ProgrammingArrayDivide And Conquer

Maximum Subarray

Given an integer array nums , find the contiguous non-empty subarray with the largest sum and return that sum. Input format Input is a single array, e.g. [[-2,1,-3,4,-1,2,1,-5,4]] .

Loading workspace…