Python: Find the majority element from a given array of size n using Collections module

Python Collections: Exercise-17 with Solution

Write a Python program to find the majority element from a given array of size n using the Collections module.

Note: The majority element algorithm finds a majority element, if there is one: that is, an element that occurs repeatedly for more than half of the elements of the input.

Sample Solution:

Python Code:

# Import the collections module to use the Counter class
import collections

# Define a class named 'Solution' for a solution to a problem
class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :return type: int
        """
        # Create a Counter object 'count_ele' to count the occurrences of elements in 'nums'
        count_ele = collections.Counter(nums)
        
        # Return the most common element (majority element) from the Counter result
        return count_ele.most_common()[0][0]

# Create an instance of the 'Solution' class and call the 'majorityElement' method
result = Solution().majorityElement([10, 10, 20, 30, 40, 10, 20, 10])

# Print the result obtained from the 'majorityElement' method
print(result)

Sample Output:

10

Flowchart:

Python Code Editor:

Previous: Write a Python program to find the second lowest total marks of any student(s) from the given names and marks of each student using lists and lambda. Input number of students, names and grades of each student.
Next: Write a Python program to merge more than one dictionary in a single expression.