GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /Kadane's Algorithm
←All Patterns
ArraysEvidence Contributing

Kadane's Algorithm

Track the best subarray sum ending at the current index, resetting to zero whenever the running sum turns negative.

Practice Problems: 2
Difficulty: 0 Easy·2 Medium·0 Hard

Core technique

Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.

  • Core Strategy: Track the best subarray sum ending at the current index, resetting to zero whenever the running sum turns negative.

Canonical Practice Problems

2 problems
1.Maximum SubarrayMedium
Solve on LeetCode↗
2.Maximum Sum Circular SubarrayMedium
Solve on LeetCode↗

Curated Sheets Containing This Pattern

LeetCode Top Interview 150

2 problems

→

NeetCode All

2 problems

→

Blind 75

1 problem

→

NeetCode 150

1 problem

→

Striver A2Z

1 problem

→

Striver SDE Sheet

1 problem

→

Related Algorithmic Patterns

Stack1 shared

Monotonic Deque

Arrays

Array Rotation via Triple Reversal

Arrays

Prefix Sum

GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy