Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2969. Minimum Number of Coins for Fruits II
Given prices for a collection of fruits and limited coin denominations/change rules, compute the minimum number of coins needed to buy a target set of fruits; the core challenge is combining coin-change optimization with purchase sequencing/selection constraints, typically solved using advanced DP (state compression) or min-cost flow to account for interactions between payments and available change.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.