EASY FAANG Interview Question! Maximum Average Subarray - Leetcode 643

EASY FAANG Interview Question! Maximum Average Subarray - Leetcode 643

#coding #leetcode #programming #interview

[reptorian]

Personally, I'd just calculate the sum of first window, then do subtraction and addition with a straight division. A variable is done with addition and subtraction, and return the result of variable divided by window size.

[khiemichigo]

Implement it with O(n) time complexity to avoid TLE

[martonbalazskajari]

You could also just compare the two sums directly without dividing them and it still gives the same result