Unlimited Bills Coin Change | Dataford Interview Questions

With unlimited $3 and $4 bills, find all combinations of how many of each are needed to make exactly $N (e.g. \$ 19 has 2 solutions). Asked in the Phone screen stage.

Implement bill_combinations(n). Return a list of [three_bills, four_bills] pairs, ordered by increasing four_bills. Return an empty list when no combination exists.

Examples: n = 19 returns [[5, 1], [1, 4]]; n = 7 returns [[1, 1]].

Constraints: 0 <= n <= 10^9; bill counts must be nonnegative integers.

Constraints

0 <= n <= 10^9
Bill counts must be nonnegative integers
Return solutions ordered by increasing four-dollar bill count

Function Signature

def bill_combinations(n):

Your question is Unlimited Bills Coin Change. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem