Leetcode - N-Repeated Element in Size 2N Array Solution
Poor Man
- Published
- Updated
- Reading time
- 1 min read
- Length
- 99 words
In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times.
Return the element repeated N times.
Example 1:
Text
Input: [1,2,3,3]
Output: 3Example 2:
Text
Input: [2,1,2,5,3,2]
Output: 2Example 3:
Text
Input: [5,1,5,2,5,3,5,4]
Output: 5Note:
4 <= A.length <= 100000 <= A[i] < 10000A.lengthis even
Solution in Python#
Python
from collections import Counter
class Solution:
def repeatedNTimes(self, A: List[int]) -> int:
count = Counter(A)
return count.most_common()[0][0]