Maximum Good Subarray Sum

Find a contiguous subarray whose first and last elements differ by exactly k and return the maximum possible subarray sum (or 0 if none). With n up to 1e5, the typical O(n) approach scans the array using prefix sums and a map that remembers the best starting prefix for each value to evaluate candidate ends.