Solution: Count Substrings with Only One Distinct Letter

Explore how to count substrings containing only one distinct letter by tracking consecutive character runs and summing their contributions efficiently in a single pass. This lesson helps you understand an arithmetic approach to solve this problem with a linear time complexity and constant space usage.