ee1e8abd87
* 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.1 KiB
1.1 KiB
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 597f24c1dda4e70f53c79c81 | Fibonacci sequence | 5 | 302268 | fibonacci-sequence |
--description--
Write a function to generate the nth Fibonacci number.
The nth Fibonacci number is given by:
Fn = Fn-1 + Fn-2
The first two terms of the series are 0 and 1.
Hence, the series is: 0, 1, 1, 2, 3, 5, 8, 13...
--hints--
fibonacci should be a function.
assert(typeof fibonacci === 'function');
fibonacci(2) should return a number.
assert(typeof fibonacci(2) == 'number');
fibonacci(3) should return 2.
assert.equal(fibonacci(3), 2);
fibonacci(5) should return 5.
assert.equal(fibonacci(5), 5);
fibonacci(10) should return 55.
assert.equal(fibonacci(10), 55);
--seed--
--seed-contents--
function fibonacci(n) {
}
--solutions--
function fibonacci(n) {
let a = 0, b = 1, t;
while (--n >= 0) {
t = a;
a = b;
b += t;
}
return a;
}