Available question text
Find the minimum number of positive integers (repetition allowed) whose units digit is k that sum to num, or return -1 if impossible. The problem reduces to a modular-arithmetic check: you need the smallest m (possibly 0 when num==0) such that (m*k) % 10 == num % 10 and m*k <= num, otherwise 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 2310. Sum of Numbers With Units Digit K
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source