Coin Change (Greedy)

📝 Description

Find minimum coins needed for amount (canonical coin system)

Input Format

coins[], amount

Output Format

minimum coins or -1

Constraints

1 ≤ coins.length ≤ 10, coins sorted descending

🔍 Sample Input

[25,10,5,1], 63
            

✅ Sample Output

6