gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
9a315e237af93580c8cab924951d948c95829b11
freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828) 
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

825 B
Raw Blame History

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

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.

Instructions

Tests

tests:
  - text: <code>euler258()</code> should return 12747994.
    testString: assert.strictEqual(euler258(), 12747994, '<code>euler258()</code> should return 12747994.');

Challenge Seed

function euler258() {
  // Good luck!
  return true;
}

euler258();

Solution

// solution required