Coin Change at ServiceNow

Medium47.9% acceptance

This problem has 62.5% frequency at ServiceNow.

Problem Description

You are given an integer array `coins` representing coins of different denominations and an integer `amount` representing a total amount of money. Return _the fewest number of coins that you need to make up that amount_. If that amount of money cannot be made up by any combination of the coins, ret...

Read full problem and hints

Topics

Array Dynamic Programming Breadth-First Search

Also asked at 41 companies

Accenture Accolite Adobe Affirm Agoda Airbnb Amazon Apple Bloomberg Capgemini Capital One Datadog Deloitte Deutsche Bank Epam Systems Fractal Analytics Geico Goldman Sachs Google IBM+21 more

View Full Problem

Problem Description

Topics

Also asked at 41 companies

More ServiceNow Questions