* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
		
			
				
	
	
	
		
			1.5 KiB
		
	
	
	
	
	
	
	
			
		
		
	
	
			1.5 KiB
		
	
	
	
	
	
	
	
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName | 
|---|---|---|---|---|
| 59713bd26bdeb8a594fb9413 | Count the coins | 5 | 302238 | count-the-coins | 
--description--
There are four types of common coins in US currency:
- 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--
Implement a function to determine how many ways there are to make change for a dollar using these common coins (1 dollar = 100 cents)
--hints--
countCoins should be a function.
assert(typeof countCoins === 'function');
countCoins() should return 242.
assert.equal(countCoins(), 242);
--seed--
--seed-contents--
function countCoins() {
  return true;
}
--solutions--
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];
}