* spelling: accidentally * spelling: announce * spelling: assembly * spelling: avoid * spelling: backend * spelling: because * spelling: claimed * spelling: candidate * spelling: certification * spelling: certified * spelling: challenge * spelling: circular * spelling: it isn't * spelling: coins * spelling: combination * spelling: compliant * spelling: containers * spelling: concise * spelling: deprecated * spelling: development * spelling: donor * spelling: error * spelling: everything * spelling: exceed * spelling: exist * spelling: falsy * spelling: faulty * spelling: forward * spelling: handle * spelling: indicates * spelling: initial * spelling: integers * spelling: issealed * spelling: javascript * spelling: length * spelling: maximum * spelling: minimum * spelling: mutable * spelling: notifier * spelling: coordinate * spelling: passport * spelling: perform * spelling: permuter * spelling: placeholder * spelling: progressively * spelling: semantic * spelling: submission * spelling: submit * spelling: translations * spelling: turquoise * spelling: visualization * spelling: without * spelling: registration * spelling: representation
1.8 KiB
1.8 KiB
title, id, challengeType, forumTopicId
title | id | challengeType | forumTopicId |
---|---|---|---|
Count the coins | 59713bd26bdeb8a594fb9413 | 5 | 302238 |
Description
- quarters (25 cents)
- dimes (10 cents)
- nickels (5 cents), and
- pennies (1 cent)
There are six ways to make change for 15 cents:
- A dime and a nickel
- A dime and 5 pennies
- 3 nickels
- 2 nickels and 5 pennies
- A nickel and 10 pennies
- 15 pennies
Instructions
Tests
tests:
- text: <code>countCoins</code> should be a function.
testString: assert(typeof countCoins === 'function');
- text: <code>countCoins()</code> should return 242.
testString: assert.equal(countCoins(), 242);
Challenge Seed
function countCoins() {
// Good luck!
return true;
}
Solution
function countCoins() {
let t = 100;
const operands = [1, 5, 10, 25];
const targetsLength = t + 1;
const operandsLength = operands.length;
t = [1];
for (let a = 0; a < operandsLength; a++) {
for (let b = 1; b < targetsLength; b++) {
// initialise undefined target
t[b] = t[b] ? t[b] : 0;
// accumulate target + operand ways
t[b] += (b < operands[a]) ? 0 : t[b - operands[a]];
}
}
return t[targetsLength - 1];
}