5. Kadane's Algorithm

Medium

Topics

Helpful tools to learn & understand

Visualize LogicActive Simulator

Watch key transitions, pointers, and variables update step-by-step.

Open

Check Solutions

Read clean, documented implementations across multiple patterns.

View Code

Thinkpad (Draw & Note)

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Example 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]

Output: 6

Explanation: The subarray [4,-1,2,1] has the largest sum = 6.

Example 2:

Input: nums = [1]

Output: 1

Explanation: The subarray [1] has the largest sum = 1.

Example 3:

Input: nums = [5,4,-1,7,8]

Output: 23

Explanation: The subarray [5,4,-1,7,8] has the largest sum = 23.

Example 4:

Input: nums = [-1,-2]

Output: -1

Explanation: The subarray [-1] has the largest sum = -1.

Example 5:

Input: nums = [-2, -3, 4, -1, -2, 1, 5, -3]

Output: 7

Explanation: The subarray [4, -1, -2, 1, 5] has the largest sum = 7.

Constraints:

•
•
•

Time Complexity

O(n)

Space Complexity

O(1)