Available question text
Given the 1-indexed array numWays[i] of how many ways to make amount i with an unlimited supply of unknown positive coin denominations (each ≤ n), recover the sorted set of denominations whose coin-change counts match numWays, or return [] if no such set exists — essentially invert the coin-change generating function to find the coin values.
Related questions
Continue with questions that share topics or the same question type.
- Coin Change
Coding · Array · Breadth-First Search · Complete Knapsack
- Coin Change II
Coding
- Change Data Type
Coding
- Change Directory
Coding
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 3592. Inverse Coin Change
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source