<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 {
public:
    int findSpecialInteger(vector<int>& arr) {
        ios_base::sync_with_stdio(false);
        cout.tie(nullptr);
        cin.tie(nullptr);

        unordered_map<int, int> my_map {};

        for (int x : arr) {
            my_map[x]++;
        }

        int max_frequency {};
        int num_with_max_freq {-1};

        for (const auto& pair : my_map) {
            if (pair.second > max_frequency) {
                max_frequency = pair.second;
                num_with_max_freq = pair.first;
            }
        }

        return num_with_max_freq;
    }
};
18000