38 - Coin Change - Definition

@Rishi Srivastava The coin change problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency. Problem: 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, return -1. You may assume that you have an infinite number of each kind of coin. Example: Input: coins = [1,2,5], amount = 11 Output: 3 Explanation: 11 = 5 5 1 Github: Leetcode: