Available question text
Count the total contiguous substrings whose characters are all equal by grouping consecutive identical characters and summing the number of substrings contributed by each run (for run length L this is L*(L+1)/2), returning the result modulo 1e9+7.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1759. Count Number of Homogenous Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source