Datasets:

---

teleren

/

devto

like 0

ERROR: type should be string, got "\nhttps://leetcode.com/problems/relative-sort-array/description/?envType=daily-question&envId=2024-06-11\n\n```js\n\n/**\n * @param {number[]} arr1\n * @param {number[]} arr2\n * @return {number[]}\n */\nvar relativeSortArray = function(arr1, arr2) {\n const map = new Map()\n const N = arr2.length\n\n for(let i = 0; i < arr2.length; i++) {\n map.set(arr2[i], i)\n }\n\n return arr1.sort((a,b) => {\n a = map.has(a) ? map.get(a) : N + a\n b = map.has(b) ? map.get(b) : N + b\n return a - b\n })\n};\n\n```"

ERROR: type should be string, got "https://leetcode.com/problems/subarray-sums-divisible-by-k/description/?envType=daily-question&envId=2024-06-11\n\n```javascript\n\n/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\n \nvar subarraysDivByK = function(nums, k) {\n let prefixMod = 0;\n let result = 0;\n const modGroups = new Array(k).fill(0);\n modGroups[0] = 1;\n\n for (const num of nums) {\n // Take modulo twice to avoid negative remainders.\n prefixMod = (prefixMod + num % k + k) % k;\n result += modGroups[prefixMod];\n modGroups[prefixMod]++;\n }\n\n return result;\n}\n\n```"

ERROR: type should be string, got "https://leetcode.com/problems/continuous-subarray-sum/description/?envType=daily-question&envId=2024-06-11\n\n```js\n\n/**\n * @param {number[]} nums\n * @param {number} k\n * @return {boolean}\n */\nvar checkSubarraySum = function(nums, k) {\n let sum = 0\n const remainderMap = new Map()\n remainderMap.set(0, -1)\n\n for(let i = 0; i < nums.length; i++) {\n sum += nums[i]\n\n let remainder = sum % k\n\n remainder = remainder < 0 ? remainder + k : remainder\n\n if (remainderMap.has(remainder)) {\n if (i - remainderMap.get(remainder) > 1) return true\n } else {\n remainderMap.set(remainder, i)\n }\n }\n\n return false\n};"