Number of Wonderful Substrings
Try to solve the Number of Wonderful Substrings problem.
We'll cover the following
Statement
A wonderful string is defined as a string in which at most one letter occurs an odd number of times.
For example:
The string “aabbc” is wonderful because only the letter
'c'
appears an odd number of times.The string “pqpq” is wonderful because all letters appear an even number of times.
The string “mn” is not wonderful because both
'm'
and'n'
appear an odd number of times.
You are given a string word
that consists of lowercase English letters from 'a'
to 'j'
. Your task is to return the total number of wonderful non-empty word
.
Note: If a substring appears multiple times, each occurrence should be counted separately.
Constraints:
word.length
word
consists of lowercase English letters from'a'
to'j'
.
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.