Easy
Description
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.
Example 1:
Input: nums = [3,2,3]
Output: 3
Example 2:
Input: nums = [2,2,1,1,1,2,2]
Output: 2
Constraints:
n == nums.length
1 <= n <= 5 * 10โด
-10โน <= nums[i] <= 10โน
Solutions ๐
๐ Already have an account?
Please log in to view the solution
๐ Don't have an account yet?
Access to detailed solutions requires an active subscription account. Get one now ๐
๐ Premium Content
This solution requires an active subscription to view.
Already subscribed? Try refreshing the page.