# Introduction In this challenge, our objective is to solve the "Coin Change" problem. We are given an array of coin denominations and a total amount, and we must determine the minimum number of coins required to reach that amount. If it is impossible to do so with the given coins, we should return -1. To assist us, a starter code has been provided that includes a function called `coinChange`, which we must complete.
Click the virtual machine below to start practicing