Leetcode 1449: Form Largest Integer With Digits That Add up to Target
In this Leetcode problem, we are given the cost of each digit and a target cost target
, and we try to find the maximum number satisfying the cost

Solution
We are going to use dynamic programming to find all the solutions for target values 1
to target
, given the cost.