René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-average-subarray-i","name":"#643 - Maximum Average Subarray I - LeetCode JavaScript Solutions","description":"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 h...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar findMaxAverage = function(nums, k) {\n  let sum = 0;\n  for (let i = 0; i < k; i++) {\n    sum += nums[i];\n  }\n\n  let max = sum;\n  for (let i = k; i < nums.length; i++) {\n    sum = sum - nums[i - k] + nums[i];\n    max = Math.max(max, sum);\n  }\n\n  return max / k;\n};","keywords":"LeetCode 643, #643 - Maximum Average Subarray I, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}