[LeetCode] Number of Divisible Substrings

2950. Number of Divisible Substrings Each character of the English alphabet has been mapped to a digit as shown below. A string is divisible if the sum of the mapped values of its characters is divisible by its length. Given a string s, return the number of divisible substrings of s. A substring is a contiguous non-empty sequence of characters within a string. ...

Submit