Easy
Majority Element
Easy
254 submissions
10 coins
+50 XP
Array
Hash Table
Problem Description
An array of length `n` contains one value that appears **more than** `n / 2` times. Return that value.
**Example 1:**
```
Input: nums = [3, 2, 3]
Output: 3
```
**Example 2:**
```
Input: nums = [2, 2, 1, 1, 1, 2, 2]
Output: 2
```
**Example 3:**
```
Input: nums = [7]
Output: 7
```
Constraints
- `1 <= nums.length <= 5 * 10^4`
- A majority element always exists.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share