Available question text
Pick exactly one base and 0–2 of each topping to form a total cost as close as possible to a given target (ties favor the lower sum). With n,m ≤ 10 this is a bounded-combination/knapsack-style search problem solvable by brute-force/backtracking or DP over achievable sums.
Related questions
Continue with questions that share topics or the same question type.
- 3Sum Closest
Coding · Array · Sorting · Two Pointers
- Calculate Total Shipping Cost for an Order
Coding
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
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 1774. Closest Dessert Cost
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source