Coin Change: Minimum Coins Required

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. ### Input Format - First line contains space-separated integers representing `coins`. - Second line contains an integer `amount`. ### Output Format - Print a single integer representing the minimum number of coins, or `-1` if impossible. ### Constraints - `1 <= coins.length <= 12` - `1 <= coins[i] <= 2^31 - 1` - `0 <= amount <= 10^4`