Available question text
Count the number of nonnegative integer triples (a, b, c) that sum to n with each value ≤ limit. This is a constrained stars-and-bars counting problem typically solved with combinatorics (inclusion–exclusion) or simple enumeration given small n and limit.
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 2928. Distribute Candies Among Children I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source