Finding the maximum sum subarray by trying every start and end is O(n²) or worse. Kadane's algorithm does it in one pass by deciding at each element whether to extend the current subarray or start fresh. Use it whenever the question asks for the best contiguous sum, like the most profitable stretch of days. It does not apply when you may skip elements, and remember the answer must be non-empty when every number is negative.