Leetcode 3592. Inverse Coin Change

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3592. Inverse Coin Change

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact