Skip to content

Latest commit

 

History

History
46 lines (30 loc) · 1.03 KB

Counting_Duplicates.md

File metadata and controls

46 lines (30 loc) · 1.03 KB

CodeWars Python Solutions


Counting 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

Given Code

def duplicate_count(text):
    # your code here

Solution

def duplicate_count(text):
    text = text.lower()
    chars = {char: text.count(char) for char in text}
    return len([char for char in chars if chars[char] >=2 ])

See on CodeWars.com