most_frequent_element_1.py

#@time_it
def dict_method(arr):
    ''' In this method we will use dictionary to store the 
        count of each element and then search the dictionary 
        (or) hash map for the element with maximum count
        
        this is one of the quickest methods
        
        Complexity : O(n)
    '''
    
    # initialize a dictionary/hash map
    data = {}
    
    for element in arr:
        if element not in data:
            data[element] = 1
        else:
            data[element] += 1
    
    max_value = 0
    for key,value in data.items():
        if value > max_value :
            max_value = value
            max_key = key
    
    return max_key, max_value, data

first method to return the most frequent element of a list | array | sting