DSA
Covers: Brute Force, Sliding Window. Optimal — Time O(n), Space O(1).
Prefix Sum approach.
Covers: Brute Force, Prefix Sum, Optimal Single-Pass. Best — Time O(n), Space O(n).