# LC2950 Number of Divisible Substrings
Practice note for coding interviews.
Map letters to digit weights 1..9; count substrings whose digit-sum is divisible by their length via prefix sums.
Discuss edge cases and complexity in the mock interview.
I used [try it free](https://www.linkjob.ai/) while rehearsing this pattern aloud.
Disclosure: personal study notes mentioning a practice tool.