I am referring to this problem:

https://en.wikipedia.org/wiki/Change-making_problem

I got this problem as part of a technical assessment for a job. I implemented the greedy algorithm instead of the optimal dynamic programming solution.

I have seen this problem before but never bothered solving it. I am just wondering whether it was reasonable to assume that this problem can be solved in 30 minutes by someone who has never solved it using the optimal dynamic programming solution before.

I implemented the greedy algorithm instead.

Hi,

I can help in this.

You can reach me on Skype: cis.am4 or Email: Hayden @ cisinlabs . com so that we can discuss this further.

Hayden
skype: cis.am4

Hello,
Greetings

Please let me know if you need any assistance.
I would like to help you. Feel free to contact me at- linneajones[dot]mil[at]gmail.com.

Regards
Linnea