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

1
class Solution {
2
  public int findSpecialInteger(int[] arr) {
3
    if (arr.length == 1) {
4
      return arr[0];
5
    }
6
    int count = (int) Math.ceil(arr.length / 4);
7
    System.out.println(count);
8

9
    Map<Integer, Integer> map = new HashMap<>();
10

11
    for (Integer i : arr) {
12
      map.put(i, map.getOrDefault(i, 0) + 1);
13
      if (map.get(i) > count) {
14
        return i;
15
      }
16
    }
17
    return -1;
18
  }
19
}