# Challenge: Money Change Again

Let’s solve the Money Change Problem again.

## We'll cover the following

## Problem

**Money Change Problem**

Compute the minimum number of coins needed to change the given value into coins with denominations $1$, $3$, and $4$.

**Input:** An integer $money$.

**Output:** The minimum number of coins with denominations $1$, $3$, and $4$ that changes $money$.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.