Kadane's Algorithm

The Kadane's Algorithm technique is applied when tackling problems characterized by specific invariants in the problem state or constraints:

• Core Strategy: Track the best subarray sum ending at the current index, resetting to zero whenever the running sum turns negative.
• When to use: Look for opportunities where repeated re-computation can be replaced by maintaining monotonic properties, state windows, or relational pointers.
• Interview Signal: Demonstrating this pattern shows mastery of Arrays foundations, reducing worst-case algorithmic complexity.