Python | Group and count similar records

Sometimes, while working with records, we can have a problem in which we need to collect and maintain the counter value inside records. This kind of application is important in the web development domain. Let’s discuss certain ways in which this task can be performed.

Method #1 : Using loop + Counter() + set() 

The combination of the above functionalities can be employed to achieve this task. In this, we run a loop to capture each tuple and add to set and check if it’s already existing, then increase and add a counter value to it. The cumulative count is achieved by using Counter().

The original list : [('gfg',), ('is',), ('best',), ('gfg',), ('is',), ('for',), ('Lazyroar',)]
Grouped and counted list is : [(2, 'gfg'), (2, 'is'), (1, 'best'), (1, 'for'), (1, 'Lazyroar')]

Time complexity: O(n)
Auxiliary space: O(n)

Method #2: Using Counter() + list comprehension + items() 

This is a one-liner approach and is recommended to use in programming. The task of loops is handled by list comprehension and items() are used to access all the elements of the Counter converted dictionary to allow computations.

The original list : [('gfg',), ('is',), ('best',), ('gfg',), ('is',), ('for',), ('Lazyroar',)]
Grouped and counted list is : [(2, 'gfg'), (2, 'is'), (1, 'best'), (1, 'for'), (1, 'Lazyroar')]

Time complexity: O(n), where n is the number of elements in the list “test_list”.
Auxiliary space: O(n), as it stores the result in a new list “res”.

Method #3 : Using count(),join(),list() and set() methods

The original list : [('gfg',), ('is',), ('best',), ('gfg',), ('is',), ('for',), ('Lazyroar',)]
Grouped and counted list is : [(2, 'gfg'), (1, 'best'), (1, 'Lazyroar'), (1, 'for'), (2, 'is')]

Time complexity: O(n^2) – due to the use of count() method within the for loop.
Auxiliary space: O(n) – used to store the result list.

Method 4:  using operator.countOf() method

The original list : [('gfg',), ('is',), ('best',), ('gfg',), ('is',), ('for',), ('Lazyroar',)]
Grouped and counted list is : [(2, 'gfg'), (1, 'best'), (1, 'for'), (1, 'Lazyroar'), (2, 'is')]

Time Complexity: O(N)
Auxiliary Space : O(N)

Method #5: Using defaultdict() and list comprehension

This method uses a defaultdict to count the occurrences of each sub-list in the given list. Then, it creates a new list using a list comprehension by unpacking each sub-list and adding the count value as the first element of the tuple.

The original list : [('gfg',), ('is',), ('best',), ('gfg',), ('is',), ('for',), ('Lazyroar',)]
Grouped and counted list is : [(2, 'gfg'), (2, 'is'), (1, 'best'), (1, 'for'), (1, 'Lazyroar')]

Time complexity: O(n), where n is the length of the input list test_list. 
Auxiliary space: O(k), where k is the number of distinct elements in the input list.

Method #7: Using itertools.groupby() and len()

This approach uses itertools.groupby() to group the elements of the test_list by their value, and then applies len() to each group to get the count of similar records. It then creates a new list with the count and the element value.

Approach:

1. Import itertools.
2. Sort the test_list to ensure that similar records are grouped together.
3. Use itertools.groupby() to group the elements of the test_list by their value.
4. Use a list comprehension to create a list with the count and the element value for each group.
5. Print the original list and the new list.

The original list : [('best',), ('for',), ('Lazyroar',), ('gfg',), ('gfg',), ('is',), ('is',)]
Grouped and counted list is : [(1, ('best',)), (1, ('for',)), (1, ('Lazyroar',)), (2, ('gfg',)), (2, ('is',))]

Time complexity: O(NlogN) due to sorting the list.
Auxiliary space: O(N) to store the new list.