1319. Unique Number of Occurrences
My accepted Python solution to LeetCode problem 1319, Unique Number of Occurrences, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.4MB, accepted 2025-12-30.
class Solution:
def uniqueOccurrences(self, arr: List[int]) -> bool:
from collections import Counter
count = Counter(arr)
occurrences = list(count.values())
return len(occurrences) == len(set(occurrences))