---
title: "Discussion on \"2206. Divide Array Into Equal Pairs\" | Hashnode"
description: "Discussion on \"2206. Divide Array Into Equal Pairs\". class Solution:\n    def divideArray(self, nums: List[int]) -> bool:\n        c =  Counter(nums)\n\n        for e in c:\n            if c[e] % 2 != 0:\n                return False\n\n        return True"
url: "https://hashnode.com/posts/2206-divide-array-into-equal-pairs/67d84c773b557663b0ab227d"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [2206\. Divide Array Into Equal Pairs](https://tapanrachchh.hashnode.dev/2206-divide-array-into-equal-pairs?utm_source=hashnode&utm_medium=feed)

class Solution: def divideArray(self, nums: List\[int\]) -> bool: c = Counter(nums) for e in c: if c\[e\] % 2 != 0: return False return True

Mar 17, 2025 · 1 min read · tapanrachchh.hashnode.dev  
Read the article

-   [#python](https://hashnode.com/tag/python)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#counting](https://hashnode.com/tag/counting)
-   [#hashmap](https://hashnode.com/tag/hashmap)

## Written by

[Tapan Rachchh](https://hashnode.com/@tapanrachchh)

@tapanrachchh

  
[View profile](https://hashnode.com/@tapanrachchh)

## Responses

Markdown supported · ⌘↵ to post

No responses yet.