All challenges
Algorithm challenge · DSA
Maximum Subarray
Difficulty
medium
Time
~20m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#arrays#dynamic-programming
Mission file // read carefullymedium
Find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
nums = [-2,1,-3,4,-1,2,1,-5,4] => 6 ([4,-1,2,1])
Build with
maxSubArray(nums: int[]) → intPythonJavaScriptTypeScriptGoJavaC++Rust
2 tests
Auto-graded on submit
Start challenge
Sign in to save your progress.