2090. K Radius Subarray Averages | Sliding Window | LeetCode Daily Challenge

[@aravindkumarn1776]

Nice explanation buddy. Whats the device and application are you using for your youtube videos

[@nikunjpansari2491]

The Space Complexity of Approach 2 is O(N) and not O(1)

[@deepcodes]

We don't consider averages vector, as it is the return type of fn.

[@thephalcon]

Hello sir can you implement this in js also

[@prajwalurkude007]

var getAverages = function(nums, k) { if(k === 0) return nums; let n = nums.length; let averages = new Array(n).fill(-1); if(2 * k + 1 > n) return averages; let windowSum = 0; for(let i = 0; i < (2 * k + 1); ++i) windowSum += nums[i]; averages[k] = Math.trunc(windowSum / (2 * k + 1)); for(let i = (k * 2 + 1); i < n; ++i){ let deductElement = nums[i - (2 * k + 1)]; let insertElement = nums[i]; windowSum = windowSum - deductElement + insertElement; averages[i - k] = Math.trunc(windowSum / (2 * k + 1)); } return averages; };