Find the Majority Element
Mediumjavapythonccppjavascript
Given an array of size N, find the element that appears more than N/2 times. You may assume a majority element always exists.
Input Format
The first line contains an integer N. The second line contains N space-separated integers.
Output Format
Print the majority element.
Example 1
Input
3 2 1 2
Output
2
Explanation: 2 appears 2 times, which is greater than floor(3/2) = 1.
- 1 <= N <= 100000
- 1 <= A[i] <= 1000000000
- A majority element is guaranteed to exist.
Submit an attempt to unlock the solution. (Sign in first.)
Related Problems
- Rotate an Array by K PositionsMedium · java, python, c, cpp, javascriptSolve Problem
- Maximum Subarray SumMedium · java, python, c, cpp, javascriptSolve Problem
- Find a Subarray with Given SumMedium · java, python, c, cpp, javascriptSolve Problem