Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Maximum Subarray

Hard

00:00

0 users online

Given an integer array, find the contiguous subarray with the largest sum.

Sample Input:

[-2,1,-3,4,-1,2,1,-5,4]

Sample Output:

Hints

Hint 1

Use Kadane's algorithm

Hint 2

Track current sum and maximum sum

Hint 3

Reset current sum if it becomes negative

Code Editor

Loading...