Subarray Questions Techniques
Sliding window, two pointers, Kadane's for max subarray sum.
arrayssubarraytechniquesUpdated 2025-09-01
Sliding Window
- Maintain window invariants
Kadane
- cur = max(a[i], cur+a[i]); best = max(best,cur)
Sliding window, two pointers, Kadane's for max subarray sum.