Beginner
1. Arithmetic Progression2. Geometric Progression3. Harmonic Progression4. No of triangles 5. Area of Polygon6. Trailing Zeros7. Min Platforms 8. Trapping Rain 9. Jump numbers10. Segregation of 0’s and 1’s11. Two SUM12. Triplet sum 13. Diagonal Sum14. Addition of two matrixes15. Subtraction of two matrixes16. Multiplication of two matrixes17. Transpose of given array18. Spiral Matrix19. Most Frequent Element20. Majority Element 21. Max difference 22. Odd occurring23. Second Largest and Second Smallest24. Next greater number25. Count Unique Elements26. Common elements 27. Removing Duplicates28. Balanced Array29. Rotating Array by k times30. Reverse Array31. Wave Array32. Merge arrays 33. Constraint Sort34. Find element in Sorted rotated array35. Sub Array Sum36. Largest subarray of 0’s and 1’s 37. K-Sub Array38. Max subarray sum39. Contiguous Square SumMajority Element
LEVEL:Beginner
Description
Given an array of integers have to find the majority element if exists. A element is said to be Majority Element only if the element which has to be occurred more than the half of the size of the array.
Input Format
First line contains the size of the array Next line contains the n integers separated by space.
Output Format
Print the Majority element, if doesn’t exist return Null.
5 1 1 1 1 1
1
3 1 2 2
2
6 2 5 5 4 1 3
Null
Login to see Discussion
Approach
Approach 1: Using HashMap
Step-i) Initialize a empty hashmap.
Step-ii) Iterate the array and take every element as a.
Step-iii) If a is not present in the hashmap, intialize a in hashmap as 0
Step-iv) If a is already present increase it’s value by 1.
Step-v) Now the hash map is of frequency of every element.
Step-vi) Iterate through the hash map and check for frequency of every element is greater than half the length of the array.
Time Complexity: O(n)
Space Complexity: O(n)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution