 New update is available. Click here to update.
Topics

# Divisible Substrings

Easy 0/40
Average time to solve is 15m ## Problem statement

You are given a number in the form of a string ‘S’ of length ‘N’ consisting of characters from '0' to '9' (both inclusive) .

You must return the number of substrings that are divisible by 5. Some strings divisible by 5 are ‘5’, ‘370’, and ‘1000’.

Note :

``````A substring can start with a zero. The given number may also contain leading zeroes.
``````

Example:

``````‘S'= ‘5203’

Here, four substrings are divisible by 5: ‘5’, ’520’, ‘20’, ‘0’.
``````
Detailed explanation ( Input/output format, Notes, Images )
Constraints :
``````1 <= 'T' <= 10
1 <= 'N' <= 10^5
'0' <= 'S[i]' <= '9'

Time Limit: 1 sec
``````
Sample Input 1 :
``````2
5
35602
3
100
``````
Sample Output 1 :
``````6
5
``````
Explanation Of Sample Input 1 :
``````For test case 1:

‘S'= ‘35602’
Here, six substrings are divisible by 5: ‘35’, ’3560’, ‘5’, ‘560’, ‘60’, ‘0’.

For test case 2:

‘S'= ‘100’
Here, five substrings are divisible by 5: ‘10’, ’100’, ‘0’, ‘00’, ‘0’.
``````
Sample Input 2 :
``````2
1
9
4
1555
``````
Sample Output 2 :
``````0
9
`````` Console