Solution: Count Substrings with Only One Distinct Letter

Explore how to efficiently count all substrings of a string containing only one distinct letter by tracking runs of identical characters. Understand how to implement this solution with a single pass through the string, achieving linear time complexity and constant space usage.