Maximum Subarray Sum — Practice | CodeDynamo

Courses Practice YouTube Mentorship Resume Review Playground Leaderboard Projects AI Analyzer

Command Palette

Search for a command to run...

CodeDynamo is a coding education platform helping developers learn, build, and get career ready.

Join the newsletter

Learn

All courses
Learning paths
Projects
Free YouTube tutorials
Blog & articles

Practice & Community

Coding practice
Code playground
Leaderboard
Community

Services & Support

1-to-1 mentorship
Resume review
AI resume analyzer
Verify a certificate
Contact us

© 2026 CodeDynamo. All rights reserved.

Terms Privacy Refunds Contact

rahulvsk2457@gmail.com 9140680890

Dyno — AI Assistant

Online · asks about courses & more

Hi! 👋 I'm Dyno, the CodeDynamo assistant. Ask me anything about courses, pricing, mentorship, practice, or certificates.

Powered by AI — answers can make mistakes

Maximum Subarray SumMedium

First line: n. Second line: n integers. Print the largest possible sum of a contiguous subarray (at least one element).

Example 1

Input: 9 -2 1 -3 4 -1 2 1 -5 4

Output: 6

Constraints

1 ≤ n ≤ 10^5
-10^4 ≤ values ≤ 10^4

DSAarraysdpkadane

Loading editor…

Press ⌘↵ to run or ⌘⇧↵ to submit.