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 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 collections
class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :return type: int
        """
        count_ele=collections.Counter(nums)
        return count_ele.most_common()[0][0]

result = Solution().majorityElement([10,10,20,30,40,10,20,10])
print(result)

Sample Output:

10

Flowchart:

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

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.