FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2308,3  "name": "divide-array-into-equal-pairs",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/divide-array-into-equal-pairs/",6  "date": "2022-03-05",7  "task_description": "You are given an integer array `nums` consisting of `2 * n` integers. You need to divide `nums` into `n` pairs such that: Each element belongs to **exactly one** pair. The elements present in a pair are **equal**. Return `true` _if nums can be divided into_ `n` _pairs, otherwise return_ `false`. **Example 1:** ``` **Input:** nums = [3,2,3,2,2,2] **Output:** true **Explanation:** There are 6 elements in nums, so they should be divided into 6 / 2 = 3 pairs. If nums is divided into the pairs (2, 2), (3, 3), and (2, 2), it will satisfy all the conditions. ``` **Example 2:** ``` **Input:** nums = [1,2,3,4] **Output:** false **Explanation:** There is no way to divide nums into 4 / 2 = 2 pairs such that the pairs satisfy every condition. ``` **Constraints:** `nums.length == 2 * n` `1 <= n <= 500` `1 <= nums[i] <= 500`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [3,2,3,2,2,2]",12      "output": "true "13    },14    {15      "label": "Example 2",16      "input": "nums = [1,2,3,4]",17      "output": "false "18    }19  ],20  "constraints": [21    "Each element belongs to exactly one pair.",22    "The elements present in a pair are equal.",23    "nums.length == 2 * n",24    "1 <= n <= 500",25    "1 <= nums[i] <= 500"26  ],27  "python_template": "class Solution(object):\n    def divideArray(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: bool\n        \"\"\"\n        ",28  "java_template": "class Solution {\n    public boolean divideArray(int[] nums) {\n        \n    }\n}",29  "metadata": {30    "func_name": "divideArray"31  }32}