Loading the journal
Day 51Medium
LeetCode (53)
LeetCode (53)Maximum Subarray
Kadane's Algorithm
Asked at 12 companies
9 recent
- Upstart
- Infosys
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Loading the journal
LeetCode (53)Kadane's Algorithm
9 recent
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
Step 1
Know these before you start
Tick what you already know
Concept videoStep 2
Try it on paper
5–10 minutes, no code yet
Given an integer array nums, find the subarray with the largest sum, and return its sum.
Imported 2026-10-09 from NeetCode auto-sync (reviewed).
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code · optimal solution