Answer: Panasonic Hiring | Off-Campus OA (2022) | Maximum Average Subarray I Problem

Approach Use the Sliding Window technique. Calculate the sum of the first k elements. Move the window one position at a time: Add the incoming element. Remove the outgoing element. Keep track of the maximum window sum. Return the maximum sum divided by k. Strategy Compute the sum of the first k elements. Store it as the current maximum sum. Slide the window across the array. Update the window sum efficiently. Keep updating the maximum sum. Return maxSum / k. ...