The Coin Change Problem is a classic dynamic programming problem where you are given an array of coins of different denominations and a total amount. The task is to find the minimum number of coins needed to make up the given amount. If it is impossible to make the amount with the given coins, return -1. The problem can be solved using a bottom-up approach by building a table that stores the minimum coins needed for each amount up to the target.