#ProjectEuler100
In this repo I set out to hopefully solve and document my endeavors in the #projecteuler100 challenge.
Inspired by this post from Quincy Larson, the idea is to go through the first 100 problems from the Euler project.
The problems are tackled on the freeCodeCamp platform.
By the end of the challenge, I hope to have new insight into JavaScript and a new perspective on programming. I also hope that mathematics won't force me to withdraw from achieving what promises to be a rewarding challenge.
Problems
| Number | Title | Solution | Notes |
|---|---|---|---|
| 001 | Multiples of 3 and 5 | ✔️ | ✔️ |
| 002 | Even Fibonacci Numbers | ✔️ | ✔️ |
| 003 | Largest Prime Factor | ✔️ | ✔️ |
| 004 | Largest Palindrome Product | ✔️ | ✔️ |
| 005 | Smallest Multiple | ✔️ | ✔️ |
| 006 | Sum Square Difference | ✔️ | ✔️ |
| 007 | 10001st Prime | ✔️ | ✔️ |
| 008 | Largest Product in a Series | ✔️ | ✔️ |
| 009 | Special Pythagorean Triplet | ✔️ | ✔️ |
| 010 | Summation of Primes | ✔️ | ✔️ |
| 011 | Largest Product in a Grid | ✔️ | ✔️ |
| 012 | Highly Divisible Triangular Number | ✔️ | ✔️ |
| 013 | Large Sum | ✔️ | ✔️ |
| 014 | Longest Collatz Sequence | ✔️ | ✔️ |
| 015 | Lattice Path | ✔️ | ✔️ |
| 016 | Power Digit Sum | ✔️ | ✔️ |
| 017 | Number Letter Counts | ✔️ | ✔️ |
| 018 | Maximum Path Sum I | ✔️ | ✔️ |
| 019 | Counting Sundays | ✔️ | ✔️ |
| 020 | Factorial Digit Sum | ✔️ | ✔️ |
| 021 | Amicable Numbers | ✔️ | ✔️ |
| 022 | Names Scores | ✔️ | ✔️ |
| 023 | Non-abundant Sums | ✔️ | ✔️ |
| 024 | Lexicographic Permutations | ✔️ | ✔️ |
| 025 | 1000-digit Fibonacci Number | ✔️ | ✔️ |
| 026 | Reciprocal Cycles | ✔️ | ✔️ |
| 027 | Quadratic Primes | ✔️ | ✔️ |
| 028 | Number Spiral Diagonals | ✔️ | ✔️ |
| 029 | Distinct Powers | ✔️ | ✔️ |
| 030 | Digit n Powers | ✔️ | ✔️ |