Leetcode 1759. Count Number of Homogenous Substrings
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.