René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/finding-mk-average","name":"#1825 - Finding MK Average - LeetCode JavaScript Solutions","description":"You are given two integers, m and k, and a stream of integers. You are tasked to implement a data structure that calculates the MKAverage fo...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} m\n * @param {number} k\n */\nvar MKAverage = function(m, k) {\n  this.m = m;\n  this.k = k;\n  this.stream = [];\n  this.sortedStream = [];\n  this.sum = 0;\n};\n\n/**\n * @param {number} num\n * @return {void}\n */\nMKAverage.prototype.addElement = function(num) {\n  this.stream.push(num);\n\n  const insertIndex = this.findInsertPosition(num);\n  this.sortedStream.splice(insertIndex, 0, num);\n  this.sum += num;\n\n  if (this.stream.length > this.m) {\n    const oldestElement = this.stream.shift();\n    const oldestIndex = this.sortedStream.indexOf(oldestElement);\n    this.sortedStream.splice(oldestIndex, 1);\n    this.sum -= oldestElement;\n  }\n};\n\n/**\n * @return {number}\n */\nMKAverage.prototype.calculateMKAverage = function() {\n  if (this.stream.length < this.m) {\n    return -1;\n  }\n\n  let adjustedSum = this.sum;\n\n  for (let i = 0; i < this.k; i++) {\n    adjustedSum -= this.sortedStream[i];\n  }\n  for (let i = this.sortedStream.length - this.k; i < this.sortedStream.length; i++) {\n    adjustedSum -= this.sortedStream[i];\n  }\n\n  return Math.floor(adjustedSum / (this.m - 2 * this.k));\n};\n\n/**\n * Helper method to find insert position using binary search\n * @param {number} num\n * @return {number}\n */\nMKAverage.prototype.findInsertPosition = function(num) {\n  let left = 0;\n  let right = this.sortedStream.length - 1;\n\n  while (left <= right) {\n    const mid = Math.floor((left + right) / 2);\n    if (this.sortedStream[mid] < num) {\n      left = mid + 1;\n    } else {\n      right = mid - 1;\n    }\n  }\n\n  return left;\n};","keywords":"LeetCode 1825, #1825 - Finding MK Average, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}