← Coding & DSA / 38

mediumAmazon Google Meta

Maximum Subarray (Kadane's algorithm).

Maximum subarray is the gateway 1D DP problem, and Kadane's is the O(n) one-liner. The signal is the 'extend or restart' decision at each element and the all-negative edge case most people botch. Here is the answer.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

Maximum subarray is the gateway 1D DP problem, and Kadane's is the O(n) one-liner. The signal is the 'extend or restart' decision at each element and the all-negative edge case most people botch. Here is the answer.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew

UP NEXT ON YOUR JOURNEY

Next in this trackWord Break: can a string be segmented into dictionary words?Next in this trackRotate an n×n matrix 90 degrees in place.Next in this trackBit manipulation essentials: single number, counting bits, power of two.

DISCUSSION · 0

No comments yet — be the first to share your approach.