Majority Element

Asked at Meta · Coding & Leetcode-style Questions · Difficulty: Easy

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exists in the array. Write a function to solve this problem.

Loading the problem…