To see the question, click here.
Naive Approach
The idea is to calculate the sum of every k consecutive integers and then find the maximum sum, giving us the maximum average. So, maintain two pointers i and j at the first position of the array. i wil...
