René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/sorting-three-groups","name":"#2826 - Sorting Three Groups - LeetCode JavaScript Solutions","description":"You are given an integer array nums. Each element in nums is 1, 2 or 3. In each operation, you can remove an element from nums. Return the m...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumOperations = function(nums) {\n  const n = nums.length;\n  const dp = new Array(n + 1).fill(0).map(() => new Array(4).fill(Infinity));\n  dp[0][0] = 0;\n\n  for (let i = 0; i < n; i++) {\n    for (let prev = 0; prev <= 3; prev++) {\n      for (let curr = 1; curr <= 3; curr++) {\n        if (curr >= prev) {\n          dp[i + 1][curr] = Math.min(\n            dp[i + 1][curr],\n            dp[i][prev] + (nums[i] === curr ? 0 : 1)\n          );\n        }\n      }\n    }\n  }\n\n  return Math.min(...dp[n].slice(1));\n};","keywords":"LeetCode 2826, #2826 - Sorting Three Groups, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}