freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md

---
id: 5900f5361000cf542c510049
challengeType: 5
title: 'Problem 458: Permutations of Project'
forumTopicId: 302132
---

## Description
<section id='description'>
Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}.
Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of "project".

T(7)=77-7!=818503.


Find T(1012). Give the last 9 digits of your answer.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler458()</code> should return 423341841.
    testString: assert.strictEqual(euler458(), 423341841);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler458() {

  return true;
}

euler458();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>