Minimum Deletions to Make Array Divisible LeetCode solution in Python

1
# Runtime: 1147 ms (Top 45.35%) | Memory: 25.8 MB (Top 79.68%)
2
class Solution:
3
    def minOperations(self, nums: List[int], divs: List[int]) -> int:
4
        div = reduce(gcd, divs)
5
        return next((i for i, n in enumerate(sorted(nums)) if div % n == 0), -1)