Available question text
Given nums and a small set of targets (<=4), compute the minimum total +1 increments to transform some elements of nums so that each target has at least one multiple in nums; treat each number’s cost to become a multiple of any subset’s lcm and use bitmask DP to choose numbers/subsets minimizing the sum.
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 3444. Minimum Increments for Target Multiples in an Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source