-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCounting Duplicates.js
24 lines (21 loc) · 1.04 KB
/
Counting Duplicates.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
// 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
function duplicateCount(inputString){
inputString = inputString.toLowerCase();
let charCount = {};
for (let char of inputString) {
if (char.match(/[a-z0-9]/i)) {
charCount[char] = (charCount[char] || 0) + 1;
}
}
let duplicatesCount = Object.values(charCount).filter(count => count > 1).length;
return duplicatesCount;
}