In this post we will attempt to solve LeetCode 169. Majority Element problem using Java.
Given an array nums of size n, return the majority element. The majority element is the element that appears more than floor(n / 2) times. You may assume that the majority element always exists in the array. Constraints: o n == nums.length o 1 <= n <= 5 * 10^4 o -2^31 <= nums[i] <= 2^31 - 1 Related Topics: o Array o Hash Table o Divide and Conquer o Sorting o Counting
We are given an int array and we must return the majority element. There are several variations of this problem. I believe we have solved a couple in this post. Continue reading “LeetCode 169 Majority Element in Java”