element-appearing-more-than-25-in-sorted-array

< Previous 　　　　　　　　　　　　　　　　 Next >

1287. Element Appearing More Than 25% In Sorted Array (Easy)

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

Related Topics

[Array]

Hints

Hint 1

Divide the array in four parts [1 - 25%] [25 - 50 %] [50 - 75 %] [75% - 100%]

Hint 2

The answer should be in one of the ends of the intervals.

Hint 3

In order to check which is element is the answer we can count the frequency with binarySearch.