These are my open source solutions to Project Euler.
Feel free to contribute if you find a solution (or an improvement)!
Find the logic to my solutions at ALGO.md!
Each solution in code will include an expanded and min-mode(if possible) answer. Solutions are in the best runtime complexity I could achieve.
My goal for this repo is to help others understand why computer science is so important in programming - this is why I've added ALGO.md to explain and brute force algorithms to contrast the CS solutions! 😄
- 001: Multiples of 3 and 5 | Code | Explained! |
O(1)|Jacob Erickson - 002: Even Fibonacci numbers | Code | Explained! |
O(n/3)|Jacob Erickson - 003: Largest prime factor | Code | Explained! |
O(sqrt(n))|Jacob Erickson - 004: Largest palindrome product | Code | Explained! |
O(n^2)|Jason Piao - 005: Smallest multiple
...
- Achieve the best runtime complexity I can!
- Don't use Google/Stack Overflow!!