Given a string of lowercase letters, count the substrings made of one letter repeated, counting substrings at different positions separately.
Unlock detailed company stats for this questionUpgrade
Given a string S of 1 to 100 lowercase letters, count its substrings that consist of a single letter repeated one or more times. Two such substrings count separately whenever they occupy different positions, even if they read the same. Example: 'aabaaa' has 10 of them: five 'a', one 'b', three 'aa' and one 'aaa'.
Community answers
No answers contributed by the community yet.
Related questions
Given a string of lowercase English letters, count the ways to add one letter to it so that the result is a permutation of some palindrome.Given two strings and two allowed operations, swapping positions of letters and converting all occurrences of one character to another, can the first string be transformed into the second?Related courses
Course