Available question text
Given costs for apple packs (typically of sizes that double: 1, 2, 4, …), find the minimum cost to buy at least a target number of apples by choosing any combination of packs. This is an unbounded knapsack / DP problem where you optimize pack prices (handle missing/cheaper larger packs) and often use binary decomposition or greedy on powers-of-two packs to form the target.
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 2473. Minimum Cost to Buy Apples
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source