The problem. Given an array nums of size n, return the majority element — the value that appears more than n / 2 times. You may assume a majority element always exists.
![The array [2, 2, 1, 1, 1, 2, 2]. The four 2s are highlighted: 2 appears 4 times out of 7, which is more than half.](/drawings/72f2c07a-afda-4134-8dec-de20326fd7c3.svg)
Input: nums = [3, 2, 3]
Output: 3
Input: nums = [2, 2, 1, 1, 1, 2, 2]
Output: 2"More than half" is a strong promise: the majority value outnumbers all the other values put together. Keep that sentence in mind — the best solution is built entirely on it.
Free account
Sign up to read the rest of this lesson: 5 more sections, 3 drawings, a dry-run simulator and code in JavaScript, Python, Java and C++.
Still to come