freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.spanish.md

id, localeTitle, challengeType, title

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

Description

Una secuencia se define como:

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

Instructions

Tests

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

Challenge Seed

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

euler258();

Solution

// solution required