Problem : Count the number of Duplicates

[NeedHelpPython]

Problem : Count the number of Duplicates

Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits.

Example

"abcde" -> 0 # no characters repeats more than once
"aabbcde" -> 2 # 'a' and 'b'
"aabBcde" -> 2 # 'a' occurs twice and 'b' twice (b and B)
"indivisibility" -> 1 # 'i' occurs six times
"Indivisibilities" -> 2 # 'i' occurs seven times and 's' occurs twice
"aA11" -> 2 # 'a' and '1'
"ABBA" -> 2 # 'A' and 'B' each occur twice

def duplicate_count(text):
    new_list = []
    list_to_set = set(new_list)
    for i in text:
      new_list.append(i)
      if len(new_list) != len(list_to_set):
        print("Difference")
    return new_list
test = duplicate_count("665")

Im kind of stuck how to solve this in python. I think my thought process is correct but im not executing it correctly.. What I did is first I make a empty list and then I convert it into the set and try to compare the differences from there. I see all the solutions to the problem using a dictionary when I searched up the problem but I want it to be completed using a set/list. Can someone help me on this? I know my code isn't correct

[BashBedlam]

I recommend that you go with the dictionary. I think your going to find that there will be a lot of trouble trying to index a set. Here's one way to go about it using a dictionary.

def duplicate_count (text) :
	total = 0
	duplicates = {}
	for character in text.lower () :
		if character in duplicates :
			duplicates [character] += 1
			if duplicates [character] < 3 :
				total += 1
		else :
			duplicates [character] = 1

	print (f'\nThere are {total} reoccurring characters.')
	for element in duplicates :
		if duplicates [element] > 1 :
			print (f'\t"{element}" occurs {duplicates [element]} times.')

duplicate_count ('abCccdeeEEefgg12334')

[OGLORD]

I recommend that you go with the dictionary. I think your going to find that there will be a lot of trouble trying to index a set. Here's one way to go about it using a dictionary.

def duplicate_count (text) :
	total = 0
	duplicates = {}
	for character in text.lower () :
		if character in duplicates :
			duplicates [character] += 1
			if duplicates [character] < 3 :
				total += 1
		else :
			duplicates [character] = 1

	print (f'\nThere are {total} reoccurring characters.')
	for element in duplicates :
		if duplicates [element] > 1 :
			print (f'\t"{element}" occurs {duplicates [element]} times.')

duplicate_count ('abCccdeeEEefgg12334')

Hello, sorry to post here but I've tried to PM you and seems like you cannot receive them. I'd like to get in touch with you regarding some project, how can I? Thank you

[Gribouillis]

I see two ways using modules from the standard library, the first uses class collections.Counter

from collections import Counter

def duplicate_counts(text):
    return sum(v > 1 for v in Counter(text.lower()).values())

The other one uses function re.findall()

import re

def duplicate_counts(text):
    return len(re.findall(r'(.)\1+', ''.join(sorted(text.lower()))))

Here is a third way using module numpy

import numpy as np

def duplicate_counts(text):
    x = np.unique(np.fromiter(text.lower(), '|S1'), return_counts=True)[1]
    return np.count_nonzero(x > 1)