At first sight, it may seem that online editors are pretty much the same, but you’ll discover that it’s not that way at all. Having a powerful document management solution like DocHub, you can do far more than with traditional tools. What makes our editor unique is its ability not only to promptly Change number in Deal but also to create documentation completely from scratch, just the way you need it!
In spite of its extensive editing capabilities, DocHub has a very easy-to-use interface that offers all the features you want at your fingertips. Therefore, altering a Deal or an entirely new document will take only a couple of minutes.
Subscribe to a free trial and celebrate your greatest-ever document-related experience with DocHub!
hey everyone welcome back and lets write some more neat code today today lets solve another classic dynamic programming problem coin change and we get a pretty simple uh description so were given a list of coins of different values and were also given a total amount of money that we want to sum up to but we want to use the fewest number of coins possible to make up or to sum up to that amount and its possible that that amount of money cannot be made up with any combination of the coins that we have and then we want to return negative one if thats the case and luckily for us were actually given an infinite number of each coin so in the first example we have coins of value 1 2 and 5 and we have infinite quantities of these coins the amount that we want to sum up to is 11 and basically you know just look at this whats the fewest number of coins we could do well of course we want to use a five because its the biggest one we can use another five and then we just need a one left if