Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

796 B

id, challengeType, title, forumTopicId
id challengeType title forumTopicId
5900f46e1000cf542c50ff81 5 Problem 258: A lagged Fibonacci sequence 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.

Instructions

Tests

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

Challenge Seed

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

euler258();

Solution

// solution required