human
I found an interesting problem on https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/:
Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time.
Return that integer.
 
Example 1:
Input: arr = [1,2,2,6,6,6,6,7,10]
Output: 6

 
Constraints:

1 <= arr.length <= 10^4
0 <= arr[i] <= 10^5

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
    def findSpecialInteger(self, arr: List[int]) -> int:
        for num in arr:
            if arr.count(num) > (len(arr)//4):
                return num