Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
Oliver Eyton-Williams 0bd52f8bd1 Feat: add new Markdown parser (#39800)
and change all the challenges to new `md` format.
2020-11-27 10:02:05 -08:00

527 B

id, title, challengeType, forumTopicId
id title challengeType forumTopicId
5900f46e1000cf542c50ff81 Problem 258: A lagged Fibonacci sequence 5 301906

--description--

A sequence is defined as:

gk = 1, for 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, for k ≥ 2000. Find gk mod 20092010 for k = 1018.

--hints--

euler258() should return 12747994.

assert.strictEqual(euler258(), 12747994);

--seed--

--seed-contents--

function euler258() {

  return true;
}

euler258();

--solutions--

// solution required