Yan Cui
I help clients go faster for less using serverless technologies.
This article is brought to you by
The real-time data platform that empowers developers to build innovative products faster and more reliably than ever before.
Problem
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
It is possible to make £2 in the following way:
1x£1 + 1x50p + 2x20p + 1x5p + 1x2p + 3x1p
How many different ways can £2 be made using any number of coins?
Solution
// the total and available coins
let total, coins = 200, [1;2;5;10;20;50;100;200]
// implement the coin change algorithm
let rec count n m =
if n = 0 then 1
else if n < 0 then 0
else if (m <= 0 && n >= 1) then 0
else (count n (m-1)) + (count (n-coins.[m-1]) m)
let answer = count total coins.Length
Not much for me to add here really, see here for the coin change algorithm which I’ve used in my solution.
Whenever you’re ready, here are 4 ways I can help you:
- Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
- Do you want to know how to test serverless architectures with a fast dev & test loop? Check out my latest course, Testing Serverless Architectures and learn the smart way to test serverless.
- I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
- Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.
Pingback: Project Euler — Problem 76 Solution | theburningmonk.com
Pingback: Project Euler — Problem 77 Solution | theburningmonk.com