Solving Maximum Subarray using Kadane’s algorithm.

Problem

Find contiguous max sum.

Pattern

This problem demonstrates the Kadane’s algorithm pattern.

Approach

Track current and global max.

Solution 

  // Solution for Maximum Subarray
// Pattern: Kadane's algorithm
// O(n) time, O(1) space

Complexity

O(n) time, O(1) space

Best Practices

  • Identify the pattern before coding — pattern recognition saves time
  • Handle edge cases: empty input, single element, duplicates
  • Use descriptive variable names even in timed interviews
  • Test with the provided examples plus one custom case