In this repository, I share my journey of solving various Project Euler problems, while exploring the fascinating world of mathematics and applying my programming skills to solve various problems.
By solving these problems, I aim to improve my programming skills and enhance my problem-solving abilities by learning new concepts, techniques, and algorithms.
Note: The solutions provided in this repository have been developed with consideration for the time limit set by HackerRank.
Project Euler is a collection of challenging mathematical and computational problems that require creative problem-solving skills to solve. These problems range in difficulty from relatively easy to extremely challenging, and they cover a wide range of topics, from number theory and combinatorics to graph theory and computational geometry.
The problems on Project Euler are designed to be tackled using computer programming, and many of them require efficient algorithms and data structures to be solved within a reasonable amount of time. As such, solving these problems not only requires mathematical insight but also programming skills.
You can find Project Euler problems in the links below:
- hackerrank
- projecteuler
- Abundant numbers are those whose proper divisors sum up to a number greater than the original number.
Problem 1: Multiples of 3 and 5 [Easy]
Find the sum of all the multiples of 3 or 5 below a given number.
Problem 2: Even Fibonacci numbers [Easy]
Find the sum of all the even-valued terms in the Fibonacci sequence whose values do not exceed a given limit.
Problem 3: Largest prime factor [Easy]
Find the largest prime factor of a given number.
Problem 4: Largest palindrome product [Medium]
[Hackerrank] Find the largest palindrome made from the product of two 3-digit numbers which is less than a given number N.
[projecteuler] Find the largest palindrome made from the product of two 3-digit numbers.
Problem 5: Smallest multiple [Medium]
Find the smallest positive number that is evenly divisible by all of the numbers from 1 to a given number.
Problem 6: Sum square difference [Easy]
Find the difference between the sum of the squares of the first n natural numbers and the square of the sum.
Problem 7: 10001st prime [Easy]
Find the nth prime number, where n is a given number.
Problem 8: Largest product in a series [Easy]
Find the thirteen adjacent digits in a 1000-digit number that have the greatest product. Return the product.
Problem 9: Special Pythagorean triplet [Easy]
Find the product of the only Pythagorean triplet (a, b, c) where a + b + c = n and a2 + b2 = c2, for a given value of n.
Problem 10: Summation of primes [Medium]
Find the sum of all the prime numbers below a given number.
Problem 11: Largest product in a grid [Easy]
Find the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in a given grid.
Problem 12: Highly divisible triangular number [Easy]
Find the first triangular number with over a given number of divisors.
Problem 13: Large sum [Easy]
Find the first ten digits of the sum of a given list of 50-digit numbers.
Problem 14: Longest Collatz sequence [Easy]
Find the starting number below a given limit that produces the longest Collatz sequence.
Problem 15: Lattice paths [Easy]
Find the number of routes from the top left corner to the bottom right corner of a given grid of size n x m, where you can only move right or down.
Problem 16: Power digit sum [Easy]
Find the sum of the digits of the result of 2n.
Problem 17: Number to Words [Easy]
[Hackerrank] Given a number, you have to write it in words.
[projecteuler] Find the number of letters used to write out all the numbers from 1 to a given number, inclusive. (writing out numbers is in compliance with British usage)
Problem 18: Maximum path sum I [Easy]
Find the maximum sum of numbers that can be obtained by starting at the top of a triangle of numbers and moving to adjacent numbers on the row below, for a given triangle.
Problem 19: Counting Sundays [Easy]
Find the number of Sundays that fell on the first of the month between two dates(both inclusive)
Problem 20: Factorial digit sum [Easy]
Find the sum of the digits in the number N!
Problem 21: Amicable numbers [Easy]
Evaluate the sum of all the amicable numbers under a given number.
Problem 22: Names scores [Easy]
Calculate the total score of a list of names, where the score for each name is calculated by multiplying its alphabetical position by the sum of its letter values.
Problem 23: Non-abundant sums [Easy]
[Hackerrank] Given N, print YES if it can be expressed as sum of two abundant numbers, else print NO.
[projecteuler] Find the sum of all positive integers that cannot be written as the sum of two abundant numbers.
Problem 24: Lexicographic permutations [Easy]
Find the Nth lexicographic permutation of the word "abcdefghijklm".
Problem 25: N-digit Fibonacci number [Easy]
Find the first term in the Fibonacci sequence to contain N digits.