Solution 1: Find Majority element in an array | Using Hash Map | Array Algorithms
In this video we will learn about majority element in an array. If an element is present more than n/2 times then that array is called as majority element. Here n is the size of array. we will use a hash map to find the majority element in the array. we will create a hash map and then we will maintain frequency of every element present in the array. Finally we will check if the element with maximum frequency is the majority element or not
https://github.com/self-tuts/algorith...