Element Appearing More Than 25% In Sorted Array LeetCode solution in Python

1
class Solution:
2
def findSpecialInteger(self, arr: List[int]) -> int:
3
l = len(arr)
4
c = (l // 4) + 1
5
d = {}
6
for i in arr:
7
if i in d:
8
d[i] += 1
9
else:
10
d[i] = 1
11
if d[i] >= c:
12
return i

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0