This repository chronicles my Project Euler progress so far. I originally heard about Project Euler from my high school teacher, where we had to solve a few problems for class.
Before I created this repo, I made ~80 of these individually, but now I'm refactoring to make future problems easier and for easier readability. I have made some fair efforts to optimize these problems, even if they already run rather quickly.
Problem files are all in one file titled P###.java and all extend the Problem abstract class. Problems which can easily be parameterized extend ParameterizedProblem. EulerTools contains functions about simple properties of numbers. CollectionTools contains functions relavent to arrarys, Lists, or Strings. PrimeFinder, as the name suggests finds primes and contains functions relating to primes, including factorizing. Problems are timed via the Problem Timers, grouped by 50's (a whole page in the archives).
My Friend key is 828030_wbn0K2yrCY6ArLRJFSL3JFtSs5PKrXC3. A spreadsheet compiling my runtimes can be found here: https://docs.google.com/spreadsheets/d/12H4ZGuuocjOavenPG3hvZQLHR3obMMyhbHItba9GMYY/edit?usp=sharing