Majority Element

Easy
ArrayVotingHash TableAdobeAmazon
Given an array where one value appears more than floor(n / 2) times, print that majority value. Input format: - First line: n - Second line: n integers

Constraints

1 <= n <= 10^5
-10^9 <= nums[i] <= 10^9
A majority element is guaranteed to exist.

Sample tests

Sample 1

Sample 2

Sign in to submit