FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2904,3  "name": "sorting-three-groups",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/sorting-three-groups/",6  "date": "2023-08-05",7  "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?",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [2,1,3,2,1]",12      "output": "3 "13    },14    {15      "label": "Example 2",16      "input": "nums = [1,3,2,1,3,3]",17      "output": "2 "18    },19    {20      "label": "Example 3",21      "input": "nums = [2,2,2,2,3,3]",22      "output": "0 "23    }24  ],25  "constraints": [26    "1 <= nums.length <= 100",27    "1 <= nums[i] <= 3"28  ],29  "python_template": "class Solution(object):\n    def minimumOperations(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"\n        ",30  "java_template": "class Solution {\n    public int minimumOperations(List<Integer> nums) {\n        \n    }\n}",31  "metadata": {32    "func_name": "minimumOperations"33  }34}