Minimum coins where greedy fails

You have unlimited coins of denominations {1,5,6,9}\{1, 5, 6, 9\}. What is the minimum number of coins whose values sum to exactly 1111?

Show hints (2)+
  1. Greedy takes 99 first - is that actually optimal here?
  2. Try a split that skips the largest coin.

Answer

Reveal answer →

2

Create a free account to see the full worked solution and track your progress.

Interview format: Hedge Fund Quant, Systematic & Data-Driven Trading

Related questions