You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Maximum Subarray: Kadane's AlgorithmMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
MediumDynamic Programming•Acceptance: 50.4%
Maximum Subarray: Kadane's Algorithm
Targeted in FAANG & Tech OA:GoogleAmazonMicrosoft
Real-World Engineering Context
Used in computer vision (finding highest-contrast regions in an image) and genomic sequence alignment to locate protein coding regions.
Given an integer array `nums`, find the subarray with the largest sum, and return its sum.
Sample Test Cases
Input: [[-2,1,-3,4,-1,2,1,-5,4]]
Expected: 6
Input: [[1]]
Expected: 1
Input: [[5,4,-1,7,8]]
Expected: 23
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.