René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-subsequence-score","name":"#2542 - Maximum Subsequence Score - LeetCode JavaScript Solutions","description":"You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indi...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar maxScore = function(nums1, nums2, k) {\n const zipped = nums1.map((num1, i) => [num1, nums2[i]]).sort((a, b) => b[1] - a[1]);\n const heap = new MinPriorityQueue();\n let result = 0;\n let sum = 0;\n\n for (const [num, min] of zipped) {\n heap.enqueue(num);\n sum += num;\n\n if (heap.size() == k) {\n result = Math.max(result, sum * min);\n sum -= heap.dequeue().element;\n }\n }\n\n return result;\n};","keywords":"LeetCode 2542, #2542 - Maximum Subsequence Score, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}