Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2206 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2206 # by problem number
lcpy gen -s divide_array_into_equal_pairs # by problem name
nums consisting of 2 * n integers.
You need to divide nums into n pairs such that:
true if nums can be divided into n pairs, otherwise return false.
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.
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.
class Solution:
# Time: O(n)
# Space: O(n)
def divide_array_into_equal_pairs(self, nums: list[int]) -> bool:
counts: dict[int, int] = {}
for num in nums:
if num in counts:
del counts[num]
else:
counts[num] = 1
return not counts
| Time | Space |
|---|---|
| O(n) | O(n) |