{ "id": 2904, "name": "sorting_three_groups", "difficulty": "Medium", "link": "https://leetcode.com/problems/sorting-three-groups/", "date": "1691193600000", "task_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 **minimum** number of operations to make `nums` **non-decreasing**. **Example 1:** **Input:** nums = [2,1,3,2,1] **Output:** 3 **Explanation:** One of the optimal solutions is to remove `nums[0]`, `nums[2]` and `nums[3]`. **Example 2:** **Input:** nums = [1,3,2,1,3,3] **Output:** 2 **Explanation:** One of the optimal solutions is to remove `nums[1]` and `nums[2]`. **Example 3:** **Input:** nums = [2,2,2,2,3,3] **Output:** 0 **Explanation:** `nums` is already non-decreasing. **Constraints:** `1 <= nums.length <= 100` `1 <= nums[i] <= 3` **Follow-up:** Can you come up with an algorithm that runs in `O(n)` time complexity?", "public_test_cases": [ { "label": "Example 1", "input": "nums = [2,1,3,2,1]", "output": "3 " }, { "label": "Example 2", "input": "nums = [1,3,2,1,3,3]", "output": "2 " }, { "label": "Example 3", "input": "nums = [2,2,2,2,3,3]", "output": "0 " } ], "private_test_cases": [ { "input": [ 2, 1, 3, 3, 3, 3, 3, 2, 1, 2, 1, 1, 3, 2, 3, 1, 3, 3, 1, 2, 1, 1, 1, 2, 2, 3, 1, 1, 3, 1, 3, 1, 2, 1, 1, 1, 2, 2, 2, 2, 1, 3, 3, 1, 2, 1, 2, 3, 1, 1, 2, 2, 2, 3, 1, 1, 3, 2, 2, 1, 2, 2, 3, 1, 2, 2 ], "output": 35 }, { "input": [ 2, 3, 1, 2, 3, 3, 2, 3, 1, 1, 1, 3, 1, 3, 3, 3, 2, 1, 1, 3, 1, 1, 3, 2, 2, 1, 3, 2, 2, 2, 1, 2, 3, 2, 1, 1, 3, 3, 2, 1, 2, 3, 3, 2, 2, 3, 3, 3, 2, 3, 3, 2, 3, 2, 1, 3, 1 ], "output": 30 }, { "input": [ 3, 2, 2, 2, 2, 1, 1, 1, 2, 3, 3, 1, 3, 3, 2, 1, 3, 1, 1, 1, 1, 2, 2, 2, 3, 2, 2, 2, 1, 1, 1, 2, 2, 2, 1, 1, 2, 3, 3, 2, 2, 3, 3, 3, 2, 2, 3, 1, 1, 3, 3, 3, 3, 1, 1, 2, 3, 3, 1, 1, 2, 1, 1, 3, 1, 2, 2, 2, 3, 3, 3, 3, 1, 3, 3, 1, 1, 2, 1, 1, 3, 2, 1, 2, 3 ], "output": 45 }, { "input": [ 2, 1, 2, 1, 3, 1, 3, 3, 2, 2, 1, 2, 3, 3, 3, 1, 3, 3, 1, 3, 2, 2, 3, 1, 3, 1, 1, 3, 2, 3, 2, 2, 2, 2, 2, 1, 3, 2, 1, 2, 3, 3, 2, 2, 1, 3, 2, 1, 3, 1, 2, 2, 3, 3, 3, 2, 1, 2 ], "output": 33 }, { "input": [ 2, 1, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 3 ], "output": 5 }, { "input": [ 1, 3, 2, 1, 1, 3, 3, 1, 1, 2, 1, 3, 2, 3, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 2, 1, 2, 1, 1, 1, 3, 3, 2, 3, 1, 2, 3, 2, 2, 2, 2, 1 ], "output": 20 }, { "input": [ 2, 1, 1, 2, 1, 2, 1, 2, 3, 1, 3, 2, 2, 2, 2, 3, 3, 1, 3, 3, 2, 1, 2, 3, 3, 3, 2, 2, 1, 1, 1, 2, 1, 3, 2, 2, 3, 3, 1, 3, 1, 1, 3, 1, 2, 3, 3, 3, 2, 2, 1, 1, 3 ], "output": 28 }, { "input": [ 1, 2, 3, 1, 3, 3, 2, 2, 1, 2, 1, 2, 2, 2, 3, 2, 1, 2, 3, 3, 3, 3, 2, 1, 2, 2, 3, 2, 3, 1, 2, 3, 2, 3, 3, 1, 3, 2, 1, 1, 1, 3, 3, 2, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 2, 3, 2, 1, 1, 2, 3, 3, 1, 1, 1, 3, 3, 2, 1, 3, 1, 2, 1, 3, 3, 3, 3, 1, 1, 3, 1, 2, 1, 2, 2, 1, 3, 1 ], "output": 48 }, { "input": [ 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 2, 1, 1, 1, 1, 1, 3, 2, 3, 3, 2, 1, 1, 2, 2, 2, 2, 2, 3, 2, 3, 3, 2, 2, 1, 2, 1, 3, 2, 2, 3, 2, 3, 1, 2, 3, 2, 3, 1, 2, 2, 3, 1, 1, 1, 3, 2, 1, 1, 3, 1, 2, 1, 3, 1, 3, 3, 2, 3, 2, 1, 1, 2, 1, 2 ], "output": 42 }, { "input": [ 1, 2, 2, 3, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 3, 2, 2 ], "output": 5 } ], "haskell_template": "minimumOperations :: [Int] -> Int\nminimumOperations nums ", "ocaml_template": "let minimumOperations (nums: int list) : int = ", "scala_template": "def minimumOperations(nums: List[Int]): Int = { \n \n}", "java_template": "public static int minimumOperations(List nums) {\n\n}", "python_template": "class Solution(object):\n def minimumOperations(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n " }