Minimal Currency Note Combination | Dataford Interview Questions

Find the minimum number of currency notes and values that sum to a given amount.

Asked in the technical interview 2 stage. Programming question 1.

Implement min_currency_notes(notes, amount). notes is a list of distinct positive integers, and each note may be used unlimited times. Return [minimum_count, selected_notes], where selected_notes is one optimal combination in descending order. Return [-1, []] if the amount cannot be formed.

Examples:

notes = [1, 3, 4], amount = 6 returns [2, [3, 3]].
notes = [2, 4], amount = 7 returns [-1, []].

Constraints: 1 <= len(notes) <= 50, 1 <= notes[i] <= 10,000, 0 <= amount <= 10,000.

Constraints

1 <= len(notes) <= 50
1 <= notes[i] <= 10,000
Notes are distinct positive integers
Each note may be used unlimited times
0 <= amount <= 10,000

Function Signature

def min_currency_notes(notes, amount):

Your question is Minimal Currency Note Combination. 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