René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-absolute-sum-difference","name":"#1818 - Minimum Absolute Sum Difference - LeetCode JavaScript Solutions","description":"You are given two positive integer arrays nums1 and nums2, both of length n. The absolute sum difference of arrays nums1 and nums2 is define...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar minAbsoluteSumDiff = function(nums1, nums2) {\n  const MOD = 1e9 + 7;\n  const sortedNums1 = [...nums1].sort((a, b) => a - b);\n  let totalDiff = 0;\n  let maxReduction = 0;\n\n  for (let i = 0; i < nums1.length; i++) {\n    const currentDiff = Math.abs(nums1[i] - nums2[i]);\n    totalDiff = (totalDiff + currentDiff) % MOD;\n\n    let left = 0;\n    let right = nums1.length - 1;\n    while (left <= right) {\n      const mid = Math.floor((left + right) / 2);\n      const newDiff = Math.abs(sortedNums1[mid] - nums2[i]);\n      const reduction = currentDiff - newDiff;\n      maxReduction = Math.max(maxReduction, reduction);\n\n      if (sortedNums1[mid] < nums2[i]) left = mid + 1;\n      else right = mid - 1;\n    }\n  }\n\n  return (totalDiff - maxReduction + MOD) % MOD;\n};","keywords":"LeetCode 1818, #1818 - Minimum Absolute Sum Difference, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}