Maximum Trailing Zeros in a Cornered Path LeetCode solution in Python

1
import numpy as np
2

3

4
class Solution:
5
    def maxTrailingZeros(self, grid: List[List[int]]) -> int:
6
        A = np.array(grid)
7

8
        def cumdivs(d):
9
            D = sum(A % d**i == 0 for i in range(1, 10))
10
            return D.cumsum(0) + D.cumsum(1) - D
11

12
        return max(
13
            np.minimum(cumdivs(2), cumdivs(5)).max()
14
            for _ in range(4)
15
            if [A := np.rot90(A)]
16
        )