LC-2575 Medium LeetCode

2575. Find the Divisibility Array of a String

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 35% Topics: Array, Math, String

Reading material

Arrays & Hashing 12 min Math & Geometry 12 min Strings 12 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

# prefix sum
class Solution(object):
    def divisibilityArray(self, word, m):
        """
        :type word: str
        :type m: int
        :rtype: List[int]
        """
        result = []
        curr = 0
        for c in word:
            curr = (curr*10+(ord(c)-ord('0')))%m
            result.append(int(curr == 0))
        return result

Solution from kamyu104/LeetCode-Solutions · MIT