Leetcode 325. Maximum Size Subarray Sum Equals k

Find the length of the longest contiguous subarray whose elements sum to k. Because the array can contain negatives (so two-pointer sliding window fails), this is typically solved in O(n) using prefix sums and a hashmap to record earliest prefix-sum indices.