Here is the algorithm I like to work on. I got this algorithm from the interviewer on March 1, 2020 10:00 PM mock interviewer, who is a Uber engineer.
Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter.
For example, for N = 4 and S = {1,2,3}, there are four solutions: {1,1,1,1},{1,1,2},{2,2},{1,3}. So output should be 4. For N = 10 and S = {2, 5, 3, 6}, there are five solutions: {2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5} and {5,5}. So the output should be 5.
Actionable Items
The above algorithm is Leetcode 518 coin change 2, and I like to review both algorithms, 518 coin change, and 322 coin change.
No comments:
Post a Comment