dsa · easy

Majority Element

ArrayHash Map

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.

Arguments

• nums — the input array of integers

**Example 1:** `` Input: nums = [3,2,3] Output: 3 ``

Constraints

n == nums.length; 1 <= n <= 5 * 10^4 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.

Examples

Example 1

Input:
[3,2,3]

Expected:
3

Example 2

Input:
[2,2,1,1,1,2,2]

Expected:
2

Open in the Dojo editor