Given an array of size N, find the majority element. The majority element is the element that appears more than times in the given array.
Input: [3, 2, 3] Output: 3 Input: [2, 2, 1, 1, 1, 2, 2] Output: 2
The problem has been solved using 4 different methods in the previous post. In this post hashing based solution is implemented. We count occurrences of all elements. And if count of any element becomes more than n/2, we return it.
Hence if there is a majority-element, it will be the value of the key.
Below is the implementation of the above approach:
Below is the time and space complexity of the above algorithm:-
Time Complexity : O(n)
Auxiliary Space : O(n)
- Majority Element
- Check if an array has a majority element
- Find the Majority Element | Set 3 (Bit Magic)
- Count majority element in a matrix
- Majority element in a linked list
- Majority element in a circular array of 0's and 1's
- Check for Majority Element in a sorted array
- Double Hashing
- Hashing | Set 1 (Introduction)
- Coalesced hashing
- Hashing in Java
- Applications of Hashing
- Hashing | Set 2 (Separate Chaining)
- Hashing | Set 3 (Open Addressing)
- C++ program for hashing with chaining
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.