You are given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average ...

//We are basically storing sum%k and storing it in the hashmap and checking it. //Math logic is that the overall sum will get cancelled out because of modulo ...