Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Fewest Bills and Coins
00:00
5 left

Fewest Bills and Coins

HardPython

Problem

In an Inspire11 payment workflow, determine how to provide exact change using the fewest available bills and coins. Given an amount in cents and a list of available denominations, return how many of each denomination to use.

Implement make_change(amount, denominations). The result must be a list whose length matches denominations; element i is the number of coins or bills with value denominations[i]. Return None when the amount cannot be formed. Any representation using the minimum total number of items is valid.

Formal Specification

  • amount: a nonnegative integer representing cents.
  • denominations: a list of distinct positive integers representing cents.
  • Return a list of nonnegative integer counts, or None if no exact representation exists.
  • Each denomination may be used unlimited times.

Constraints

  • 0 <= amount <= 100,000
  • 1 <= len(denominations) <= 50
  • 1 <= denominations[i] <= amount when amount > 0
  • Denominations are distinct positive integers
  • Each denomination can be used unlimited times

Function Signature

def make_change(amount, denominations):
Interviewer

Your question is Fewest Bills and Coins. 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.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.