All challenges
Algorithm challenge · DSA
Maximum Subarray
Difficulty
medium
Time
~20m
Format
Single
Grading
Auto-graded
#dsa#python#javascript#typescript#go#java#cpp#rust
Mission file // read carefullymedium
Given an integer array nums, return the largest sum of any contiguous non-empty subarray (Kadane's algorithm).
Build with
maxSubArray(nums: int[]) → intPythonJavaScriptTypeScriptGoJavaC++Rust
4 tests · 1 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.