1510. Find Lucky Integer in an Array
My accepted Python solution to LeetCode problem 1510, Find Lucky Integer in an Array, running in 4ms.
- Difficulty: Easy
- Python
- Runtime 4ms
- Memory 17.5MB
- 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 4ms, memory 17.5MB, accepted 2025-12-30.
class Solution:
def findLucky(self, arr: List[int]) -> int:
from collections import Counter
count = Counter(arr)
lucky = [num for num, freq in count.items() if num == freq]
return max(lucky) if lucky else -1