Available question text
Given a target integer, find the minimum number of prime numbers (repetition allowed) whose sum equals the target. The challenge combines prime testing and number‑theory observations (Goldbach-like results) or, for smaller targets, unbounded coin‑change style DP to minimize the count under the input constraints.
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 3610. Minimum Number of Primes to Sum to Target
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source