Divide Array Into Equal Pairs

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
Inputnums = [3,2,3,2,2,2]
Outputtrue
There are 6 elements in nums, so they should be divided into 3 pairs, and the pairs (2, 2), (3, 3), and (2, 2) satisfy all the conditions.
Example 2
Inputnums = [1,2,3,4]
Outputfalse
There is no way to divide nums into 2 pairs such that every pair has equal elements.

Constraints

  • nums.length == 2 * n
  • 1 <= n <= 500
  • 1 <= nums[i] <= 500

Asked at 5 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate