In this article, we will discuss how to find duplicates in a list along with their frequency count and their index positions in the list.

Let’s do this step by step,

## Step 1: Get duplicate elements in a list with a frequency count

Suppose we have a list of strings i.e.

We have created a function that accepts a list and returns a dictionary of duplicate elements in that list along with their frequency count,

Let’s call this function to find out the duplicate elements in list with their frequency,

Output

What this function is doing?

When called, this function creates a new dictionary. Then iterates over all the elements in the given list one by one. For each elements it checks if the element exists in the dictionary keys or not,

• If element does not exist in dictionary keys, then it adds the element as key in the dictionary with value as 1.
• If the element exists in dictionary keys, then increments the value of that key by 1.

Once the iteration of list elements ends, in this dictionary we have the frequency count of each element in the list. But as we are interested in duplicates only i.e. elements with frequency count more than 1. So, it removes the elements from this dictionary whose value is greater than 1. In the end, it returns a dictionary containing duplicate elements as keys and their frequency count as value.

We can achieve the same using collections.Counter() too,

### Use collections.Counter() Find duplicates in a list with frequency count

class collections.Counter([iterable-or-mapping])

We can create an object of Counter class, using an iterable or any dict like mapping. This Counter object keeps the count of each element in iterable. Let’s use this Counter object to find duplicates in a list and their count,

Output:

Now we know the frequency count of each duplicate element in the list. But what if we want to know the index position of these duplicate elements in the list? Let’s see how to do that,

## Step 2: Get indices of each duplicate element in a list along with frequency count

Suppose we have a list,

Now we want to know indices of each duplicate element in list and also their frequency count. Something like this,

So, to achieve that we have created a function,

This function accepts a list of items and then iterates over the items in the list one by one to build a dictionary. In this dictionary, the key will be the element but value will be a list of,

• Frequency Count
• List of index positions of elements similar to the given element.

Let’s call this function to find out the duplicate elements in a list, their index positions, and their frequency,

Output

What this function is doing?

When we call this function with a list argument, then this function does following steps,

• First of all, it creates a new dictionary.
• Then iterates over all the elements in list one by one and keeps the track of index positions.
• Then for each element, it checks if the element exists in the dictionary keys or not,
• If element does not exist in dictionary keys then it adds a new key-value pair in dictionary, where the key is the element and value is a list object of 2 items i.e.
• Frequency count 1
• List with current index position
• If the element exists in dictionary keys then it increments the frequency count in the value field and adds the index position in the index list.
• Once the iteration of list elements finishes, in this dictionary, we have the frequency count of each element in the list, along with index positions.
• But as we are interested in duplicates only i.e. elements with frequency count more than 1. So, it removes the elements from this dictionary whose value is greater than 1.
• In the end, it returns a dictionary containing duplicate elements as keys, whereas in value field their frequency count and index positions of duplicate entries.

The complete example is as follows,

Output:

• #### Best books to learn C++11

If you didn't find what you were looking, then do suggest us in the comments below. We will be more than happy to add that.

Do Subscribe with us for more Articles / Tutorials like this,