René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/split-array-into-consecutive-subsequences","name":"#659 - Split Array into Consecutive Subsequences - LeetCode JavaScript Solutions","description":"You are given an integer array nums that is sorted in non-decreasing order. Determine if it is possible to split nums into one or more subse...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {boolean}\n */\nvar isPossible = function(nums) {\n const map = new Map();\n const map2 = new Map();\n\n for (const n of nums) {\n map.set(n, (map.get(n) || 0) + 1);\n }\n\n for (const n of nums) {\n if (map.get(n) === 0) continue;\n\n if ((map2.get(n) || 0) > 0) {\n map2.set(n, map2.get(n) - 1);\n map.set(n, map.get(n) - 1);\n map2.set(n + 1, (map2.get(n + 1) || 0) + 1);\n } else if ((map.get(n) || 0) > 0 && (map.get(n + 1) || 0) > 0 && (map.get(n + 2) || 0) > 0) {\n map.set(n, map.get(n) - 1);\n map.set(n + 1, map.get(n + 1) - 1);\n map.set(n + 2, map.get(n + 2) - 1);\n map2.set(n + 3, (map2.get(n + 3) || 0) + 1);\n } else {\n return false;\n }\n }\n\n return true;\n};","keywords":"LeetCode 659, #659 - Split Array into Consecutive Subsequences, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}