Project-Euler-solutions

This repositorio contains solutions to Project Euler problems implmented in varios programming languajes

Structure of the repository

The repository follows the following folder structure:

	Language	Number of Problems Solved / Total
	Java	5 / 848
	C#	5 / 848
	Javascript	5 / 848
	Python	2 / 848

Inside each language folder, you will find a folder for each Project Euler problem, where the corresponding solution file is located.

ID	Title	Dificulty	Java	C#	Javascript	Python
001	Multiples of 3 or 5	◻◾◾◾◾◾◾◾◾◾ 5%	✅ Solution	✅ Solution	✅ Solution	✅ Solution
002	Even Fibonacci Numbers	◻◾◾◾◾◾◾◾◾◾ 5%	✅ Solution	✅ Solution	✅ Solution	✅ Solution
003	Largest Prime Factor	◻◾◾◾◾◾◾◾◾◾ 5%	✅ Solution	✅ Solution	✅ Solution
004	Largest Palindrome Product	◻◾◾◾◾◾◾◾◾◾ 5%	✅ Solution	✅ Solution	✅ Solution
005	Smallest Multiple	◻◾◾◾◾◾◾◾◾◾ 5%	✅ Solution	✅ Solution	✅ Solution
006	Sum Square Difference	◻◾◾◾◾◾◾◾◾◾ 5%
007	1001st Prime	◻◾◾◾◾◾◾◾◾◾ 5%
008	Largest Product in a Series	◻◾◾◾◾◾◾◾◾◾ 5%
009	Special Pythagorean Triplet	◻◾◾◾◾◾◾◾◾◾ 5%
010	Summation of Primes	◻◾◾◾◾◾◾◾◾◾ 5%
011	Largest Product in a Grid	◻◾◾◾◾◾◾◾◾◾ 5%
012	Highly Divisible Triangular Number	◻◾◾◾◾◾◾◾◾◾ 5%
013	Large Sum	◻◾◾◾◾◾◾◾◾◾ 5%
014	Longest Collatz Sequence	◻◾◾◾◾◾◾◾◾◾ 5%
015	Lattice Paths	◻◾◾◾◾◾◾◾◾◾ 5%
016	Power Digit Sum	◻◾◾◾◾◾◾◾◾◾ 5%
017	Number Letter Counts	◻◾◾◾◾◾◾◾◾◾ 5%
018	Maximum Path Sum I	◻◾◾◾◾◾◾◾◾◾ 5%
019	Counting Sundays	◻◾◾◾◾◾◾◾◾◾ 5%
020	Factorial Digit Sum	◻◾◾◾◾◾◾◾◾◾ 5%
021	Amicable Numbers	◻◾◾◾◾◾◾◾◾◾ 5%
022	Names Scores	◻◾◾◾◾◾◾◾◾◾ 5%
023	Non-Abundant Sums	◻◾◾◾◾◾◾◾◾◾ 5%
024	Lexicographic Permutations	◻◾◾◾◾◾◾◾◾◾ 5%
025	1000-digit Fibonacci Number	◻◾◾◾◾◾◾◾◾◾ 5%
026	Reciprocal Cycles	◻◾◾◾◾◾◾◾◾◾ 5%
027	Quadratic Primes	◻◾◾◾◾◾◾◾◾◾ 5%
028	Number Spiral Diagonals	◻◾◾◾◾◾◾◾◾◾ 5%
029	Distinct Powers	◻◾◾◾◾◾◾◾◾◾ 5%
030	Digit Fifth Powers	◻◾◾◾◾◾◾◾◾◾ 5%
031	Coin Sums	◻◾◾◾◾◾◾◾◾◾ 5%
032	Pandigital Products	◻◾◾◾◾◾◾◾◾◾ 5%
033	Digit Cancelling Fractions	◻◾◾◾◾◾◾◾◾◾ 5%
034	Digit Factorials	◻◾◾◾◾◾◾◾◾◾ 5%
035	Circular Primes	◻◾◾◾◾◾◾◾◾◾ 5%
036	Double-base Palindromes	◻◾◾◾◾◾◾◾◾◾ 5%
037	Truncatable Primes	◻◾◾◾◾◾◾◾◾◾ 5%
038	Pandigital Multiples	◻◾◾◾◾◾◾◾◾◾ 5%
039	Integer Right Triangles	◻◾◾◾◾◾◾◾◾◾ 5%
040	Champernowne's Constant	◻◾◾◾◾◾◾◾◾◾ 5%

How to use the solutions

• Browse through the language folders and find the specific problem that interests you.
• Inside each problem folder, you will find a file with the solution implemented in that language.
• Examines and runs the solution file in an environment suitable for that language (dev environment, interpreter, browser, etc.).
• Please note that these solutions are already implemented, so we recommend that you try to solve the problems yourself before looking at these solutions.

Contributions

Contributions are welcome! If you have a different or more efficient solution to a problem, or if you want to add solutions in other languages, feel free to do so.

1. Fork the repository.
2. Create a new branch for your contribution.
3. Add your solutions in the corresponding folder structure.
4. Make a pull request so we can review your contribution.

We look forward to seeing your contributions!

|◻◽▫◽▪◾◻◼