Available question text
Given prices where buying the (i+1)-th fruit at prices[i] coins grants you up to the next i fruits for free, choose which fruits to purchase to obtain all fruits at minimum total cost. This is a prefix-coverage minimization problem solvable with dynamic programming that picks purchases that jump coverage forward at minimal sum.
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 2944. Minimum Number of Coins for Fruits
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source