LC-2344 Hard LeetCode

2344. Minimum Deletions to Make Array Divisible

Array Math Sorting Heap (Priority Queue) Number Theory

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 58% Topics: Array, Math, Sorting, Heap (Priority Queue), Number Theory

Reading material

Arrays & Hashing 12 min Math & Geometry 12 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(n + m + logr), r is max(numsDivide)
# Space: O(1)

# gcd
class Solution(object):
    def minOperations(self, nums, numsDivide):
        """
        :type nums: List[int]
        :type numsDivide: List[int]
        :rtype: int
        """
        def gcd(a, b):  # Time: O(log(min(a, b)))
            while b:
                a, b = b, a%b
            return a

        g = reduce(gcd, numsDivide)
        mn = float("inf")
        for x in nums:
            if g%x == 0:
                mn = min(mn, x)
        return sum(x < mn for x in nums) if mn != float("inf") else -1

Solution from kamyu104/LeetCode-Solutions · MIT