Maximum Occurring Element
EasyP3Coding
Return the integer that occurs most often in nums. If several integers tie for the highest count, return the one whose first occurrence is earliest in the array.
Example 1
- Input
- nums = [1,2,2,3,3]
- Output
- 2
- Why
- 2 and 3 both occur twice and 2 appears first.
Example 2
- Input
- nums = [5]
- Output
- 5
Example 3
- Input
- nums = [4,4,1,1]
- Output
- 4
Constraints
- 1 <= nums.length <= 10^5
- -10^9 <= nums[i] <= 10^9
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 10. ⌘Enter runs, ⌘⇧Enter submits.