Easy Steps

- Calculate the sum unto K nodes
- Drop the tail and add the next node to the result
- Compare the current with that last biggest result

```
public double findMaxAverage(int[] nums, int k) {
double result = 0;
for (int i=0; i<k;i++){
result+=nums[i];
}
double prev = result;
for (int j=k; j< nums.length; j++){
double newResult = prev - nums[j-k] + nums[j];
if (newResult > result){
result = newResult;
}
prev = newResult;
}
return result/k;
}
```