0:00
Majority Element
Easy
Array
Hash Table
Divide and Conquer
Counting
Boyer-Moore

Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Examples:

Input:[3,2,3]
Output:3
Input:[2,2,1,1,1,2,2]
Output:2

Constraints:

  • n == nums.length
  • 1 ≤ n ≤ 5 * 10⁴
  • -10⁹ ≤ nums[i] ≤ 10⁹
Code Editor
Loading advanced editor...
Console Output

Ready to execute

Click "Run Code" to see your output here