Maximum Average Subarray I - Leetcode 643 - Fixed Sliding Window (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@maralazizi]

Thank you so much for a clear explanation!

[@IsaacMiranda-dd4fi]

great video! Helped me out a lot.

[@moeinhasani8718]

thanks man that was helpful!

[@НикитаБуров-ъ6р]

you shouldn't use '/' each step, i'd better return only final res as 'max_sum / k'

[@hyperboliq]

Why would it be bad to use "/" on each step?

[@lorenzospizzuoco6434]

@@hyperboliq It's not "bad", by dividing only when returning the response, you speed up a bit the solution. Performing x (number of iterations) divisions costs more then performing just one

[@hyperboliq]

@@lorenzospizzuoco6434 I see

[@achyuthvishwamithra]

You don't have to calculate average at each step, instead compare sums, and only at the end return the average.

[@josephif]

I did this question but leet code says 121 testcase paassed out of 127

[@Pillow-n8w]

For me it fails on test 116/127. On array [0, 1, 1, 3, 3] with k = 4, i return 2, but site for some unknown to me reason wants 1.25.