You are given a 0-indexed string word of length n consisting of digits, and a positive integer m.
The divisibility array div of word is an integer array of length n such that:
Return the divisibility array of word.
Examples
Example 1
Input: word = "998244353", m = 3
Output: [1,1,0,0,0,1,1,0,0]
Explanation: There are only 4 prefixes that are divisible by 3: "9", "99", "998244", and "9982443".
Example 2
Input: word = "1010", m = 10
Output: [0,1,0,1]
Explanation: There are only 2 prefixes that are divisible by 10: "10", and "1010".
Constraints
1 <= n <= 105
word.length == n
word consists of digits from 0 to 9
1 <= m <= 109
2575. Find the Divisibility Array of a String
Medium
30 Points
Array
Math
String
You are given a 0-indexed string word of length n consisting of digits, and a positive integer m.
The divisibility array div of word is an integer array of length n such that:
Return the divisibility array of word.
Examples
Example 1
Input: word = "998244353", m = 3
Output: [1,1,0,0,0,1,1,0,0]
Explanation: There are only 4 prefixes that are divisible by 3: "9", "99", "998244", and "9982443".
Example 2
Input: word = "1010", m = 10
Output: [0,1,0,1]
Explanation: There are only 2 prefixes that are divisible by 10: "10", and "1010".
Constraints
1 <= n <= 105
word.length == n
word consists of digits from 0 to 9
1 <= m <= 109
Find the Divisibility Array of a String - Practice Coding | SlaveCode