Mar 17

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Divide Array Into Equal Pairs.py

@@ -0,0 +1,21 @@
+class Solution:
+    def divideArray(self, nums: list[int]) -> bool:
+        seen = set()
+        for num in nums:
+            if num in seen:
+                seen.remove(num)
+            else:
+                seen.add(num)
+        return not seen
+
+
+def main():
+    nums = [3, 2, 3, 2, 2, 2]
+    assert Solution().divideArray(nums) is True
+
+    nums = [1, 2, 3, 4]
+    assert Solution().divideArray(nums) is False
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -20,7 +20,7 @@
 | March 14 | [2226. Maximum Candies Allocated to K Children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children/) | Medium | Solved |
 | March 15 | [2560. House Robber IV](https://leetcode.com/problems/house-robber-iv/) | Medium | Unsolved |
 | March 16 | [2594. Minimum Time to Repair Cars](https://leetcode.com/problems/minimum-time-to-repair-cars/) | Medium | Unsolved |
-| March 17 | []() |  |  |
+| March 17 | [2206. Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/) | Easy | Solved |
 | March 18 | []() |  |  |
 | March 19 | []() |  |  |
 | March 20 | []() |  |  |
@@ -40,6 +40,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 5 | 5 | 0 |
+| Easy   | 6 | 6 | 0 |
 | Medium | 11 | 5 | 6 |
 | Hard   | 0 | 0 | 0 |