Maximum Average Subarray
Given an array nums and an integer k, find the contiguous subarray of length exactly k with the maximum average, and return that average.
The fixed-size sliding window: sum the first k, then slide — add the entering element, subtract the leaving one — so each step is O(1) instead of re-summing.
findMaxAverage([1, 12, -5, -6, 50, 3], 4); // 12.75 ((-5-6+50+3)/4)