Available question text
Pick one element from each row so the total sum is as close as possible to target; this is essentially a row-by-row reachable-sums/subset-sum (knapsack-like) problem where you compute which sums are attainable and return the minimum absolute difference, with target and value bounds making DP feasible.
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 1981. Minimize the Difference Between Target and Chosen Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source