Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2344. Minimum Deletions to Make Array Divisible
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source