Element Appearing More Than 25% In Sorted Array Problem

Element Appearing More Than 25% In Sorted Array Problem — ExecCode Easy DSA Practice

Solve the Element Appearing More Than 25% In Sorted Array problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are 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.

Examples

Input {"arr": [1, 2, 2, 6, 6, 6, 6, 7, 10]}; Output 6. Input {"arr": [1, 1]}; Output 1

Constraints

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

Practice Element Appearing More Than 25% In Sorted Array free on ExecCode. Browse DSA problems, topic map, and placement guides.