<p>Given an integer array <strong>sorted</strong> in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time, return that integer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arr = [1,2,2,6,6,6,6,7,10]
<strong>Output:</strong> 6
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arr = [1,1]
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= arr.length &lt;= 10<sup>4</sup></code></li>
	<li><code>0 &lt;= arr[i] &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution:
    def findSpecialInteger(self, arr: List[int]) -> int:
        n = len(arr)
        t= n // 4
        i=0
        # Check every element at the key indices: 0, n // 4, 2 * n // 4, 3 * n // 4
        while i<n:
            # Candidate element
            candidate = arr[i]
            
            # Check if this candidate occurs more than 25% of the time
            if arr.count(candidate) > t:
                return candidate
            i=i+t
        return -1  
17500