* fix: clean-up Project Euler 241-260 * fix: typo * Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
676 B
676 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f46e1000cf542c50ff81 | Problem 258: A lagged Fibonacci sequence | 5 | 301906 | problem-258-a-lagged-fibonacci-sequence |
--description--
A sequence is defined as:
g_k = 1, for0 ≤ k ≤ 1999g_k = g_{k - 2000} + g_{k - 1999}, fork ≥ 2000.
Find g_k mod 20092010 for k = {10}^{18}.
--hints--
laggedFibonacciSequence() should return 12747994.
assert.strictEqual(laggedFibonacciSequence(), 12747994);
--seed--
--seed-contents--
function laggedFibonacciSequence() {
return true;
}
laggedFibonacciSequence();
--solutions--
// solution required