Leetcode 2344. Minimum Deletions to Make Array Divisible

Delete as few elements from nums as needed so that the smallest remaining element divides every number in numsDivide, returning -1 if impossible. Key observation: let g = gcd(all elements of numsDivide); you need the smallest element in nums that is a divisor of g (if none exists it's impossible).