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.