feat: [LeetCode #1207] Unique Number Of Occurrences (#10)

Тип: hashmap/set
Сложность: easy
Временная сложность: O(n)
Пространственная сложность: O(n)
-

Ссылка: https://leetcode.com/problems/unique-number-of-occurrences/

Author: onixlas

src/hashmap_set/unique_number_of_occurrences/__init__.py

@@ -0,0 +1,8 @@
+from typing import List
+from collections import Counter
+
+
+class Solution:
+    def uniqueOccurrences(self, arr: List[int]) -> bool:
+        counts = Counter(arr).values()
+        return len(counts) == len(set(counts))

src/hashmap_set/unique_number_of_occurrences/solution.py

@@ -0,0 +1,15 @@
+import pytest
+from src.hashmap_set.unique_number_of_occurrences.solution import Solution
+
+
+@pytest.mark.parametrize(
+    "arr, expected",
+    [
+        ([1, 2, 2, 1, 1, 3], True),
+        ([1, 2], False),
+        ([-3, 0, 1, -3, 1, 1, 1, -3, 10, 0], True),
+    ],
+)
+def test_unique_occurrences(arr, expected):
+    solution = Solution()
+    assert solution.uniqueOccurrences(arr) == expected