{"id":23131765,"url":"https://github.com/faithbyte/projecteuler","last_synced_at":"2026-04-30T10:32:30.897Z","repository":{"id":161882510,"uuid":"636515655","full_name":"faithByte/ProjectEuler","owner":"faithByte","description":"A project fueled by curiosity and a serious passion for problem solving, tackling Project Euler's brain-teasers one algorithm at a time. Who needs free time when you can have math puzzles and coding challenges?","archived":false,"fork":false,"pushed_at":"2023-06-01T23:36:11.000Z","size":61,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-09T18:41:27.650Z","etag":null,"topics":["algorithms","cpp","headache","mathematics","problem-solving","python"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/faithByte.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-05T02:53:32.000Z","updated_at":"2024-12-10T15:21:48.000Z","dependencies_parsed_at":null,"dependency_job_id":"e9114197-b903-4e88-b4d0-306520adb47a","html_url":"https://github.com/faithByte/ProjectEuler","commit_stats":null,"previous_names":["faithbyte/projecteuler"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faithByte%2FProjectEuler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faithByte%2FProjectEuler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faithByte%2FProjectEuler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faithByte%2FProjectEuler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/faithByte","download_url":"https://codeload.github.com/faithByte/ProjectEuler/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247138023,"owners_count":20889974,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","cpp","headache","mathematics","problem-solving","python"],"created_at":"2024-12-17T11:16:04.162Z","updated_at":"2026-04-30T10:32:25.861Z","avatar_url":"https://github.com/faithByte.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ProjectEuler+\n\n### Welcome to my Project Euler journey! \nIn 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. \u003cbr/\u003e\nBy solving these problems, I aim to improve my programming skills and enhance my problem-solving abilities by learning new concepts, techniques, and algorithms.\n\u003e Note:\n\u003e The solutions provided in this repository have been developed with consideration for the time limit set by **HackerRank**.\n___\n__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.\n\u003cbr/\u003e\n\u003cbr/\u003e\nThe 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.\n___\n\n\nYou can find Project Euler problems in the links below:\n\u003cul\u003e\n \u003cli\u003e\u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges)\u003e hackerrank \u003c/a\u003e\u003c/li\u003e\n \u003cli\u003e\u003ca href=https://projecteuler.net/\u003e projecteuler \u003c/a\u003e\u003c/li\u003e\n\u003cul\u003e\n \n\n \n\u003cbr/\u003e\n \n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler001/problem?isFullScreen\u003e Problem 1: \u003c/a\u003e Multiples of 3 and 5 \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the sum of all the multiples of 3 or 5 below a given number.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler002/problem?isFullScreen\u003e Problem 2: \u003c/a\u003e Even Fibonacci numbers \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the sum of all the even-valued terms in the Fibonacci sequence whose values do not exceed a given limit.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler003/problem?isFullScreen\u003e Problem 3: \u003c/a\u003e Largest prime factor \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the largest prime factor of a given number.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler004/problem?isFullScreen\u003e Problem 4: \u003c/a\u003e Largest palindrome product \u003csup\u003e[Medium]\u003c/sup\u003e\n[Hackerrank] Find the largest palindrome made from the product of two 3-digit numbers which is less than a given number N.\n\n[projecteuler] Find the largest palindrome made from the product of two 3-digit numbers.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler005/problem?isFullScreen\u003e Problem 5: \u003c/a\u003e Smallest multiple \u003csup\u003e[Medium]\u003c/sup\u003e\nFind the smallest positive number that is evenly divisible by all of the numbers from 1 to a given number.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler006/problem?isFullScreen\u003e Problem 6: \u003c/a\u003e Sum square difference \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the difference between the sum of the squares of the first n natural numbers and the square of the sum.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler007/problem?isFullScreen\u003e Problem 7: \u003c/a\u003e 10001st prime \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the n\u003csup\u003eth\u003c/sup\u003e prime number, where n is a given number.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler008/problem?isFullScreen\u003e Problem 8: \u003c/a\u003e Largest product in a series \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the thirteen adjacent digits in a 1000-digit number that have the greatest product. Return the product.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler009/problem?isFullScreen\u003e Problem 9: \u003c/a\u003e Special Pythagorean triplet \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the product of the only Pythagorean triplet (a, b, c) where a + b + c = n and a\u003csup\u003e2\u003c/sup\u003e + b\u003csup\u003e2\u003c/sup\u003e = c\u003csup\u003e2\u003c/sup\u003e, for a given value of n.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler010/problem?isFullScreen\u003e Problem 10: \u003c/a\u003e Summation of primes \u003csup\u003e[Medium]\u003c/sup\u003e\nFind the sum of all the prime numbers below a given number.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler011/problem?isFullScreen\u003e Problem 11: \u003c/a\u003e Largest product in a grid \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in a given grid.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler012/problem?isFullScreen\u003e Problem 12: \u003c/a\u003e Highly divisible triangular number \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the first triangular number with over a given number of divisors.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler013/problem?isFullScreen\u003e Problem 13: \u003c/a\u003e Large sum \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the first ten digits of the sum of a given list of 50-digit numbers.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler014/problem?isFullScreen\u003e Problem 14: \u003c/a\u003e  Longest Collatz sequence \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the starting number below a given limit that produces the longest Collatz sequence.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler015/problem?isFullScreen\u003e Problem 15: \u003c/a\u003e  Lattice paths \u003csup\u003e[Easy]\u003c/sup\u003e\nFind 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.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler016/problem?isFullScreen\u003e Problem 16: \u003c/a\u003e  Power digit sum \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the sum of the digits of the result of 2\u003csup\u003en\u003c/sup\u003e.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler017/problem?isFullScreen\u003e Problem 17: \u003c/a\u003e  Number to Words \u003csup\u003e[Easy]\u003c/sup\u003e\n[Hackerrank] Given a number, you have to write it in words. \n\n[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)\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler018/problem?isFullScreen\u003e Problem 18: \u003c/a\u003e  Maximum path sum I \u003csup\u003e[Easy]\u003c/sup\u003e\nFind 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.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler019/problem?isFullScreen\u003e Problem 19: \u003c/a\u003e  Counting Sundays \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the number of Sundays that fell on the first of the month between two dates(both inclusive)\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler020/problem?isFullScreen\u003e Problem 20: \u003c/a\u003e  Factorial digit sum \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the sum of the digits in the number N!\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler021/copy-from/1361602083?isFullScreen\u003e Problem 21: \u003c/a\u003e  Amicable numbers \u003csup\u003e[Easy]\u003c/sup\u003e\nEvaluate the sum of all the amicable numbers under a given number.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler022/copy-from/1361602158?isFullScreen\u003e Problem 22: \u003c/a\u003e  Names scores \u003csup\u003e[Easy]\u003c/sup\u003e\nCalculate 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.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler023/copy-from/1361602291?isFullScreen\u003e Problem 23: \u003c/a\u003e  Non-abundant sums \u003csup\u003e[Easy]\u003c/sup\u003e\n- Abundant numbers are those whose proper divisors sum up to a number greater than the original number.\n\n[Hackerrank] Given N, print YES if it can be expressed as sum of two abundant numbers, else print NO.\n\n[projecteuler] Find the sum of all positive integers that cannot be written as the sum of two abundant numbers.\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler024/problem?isFullScreen\u003e Problem 24: \u003c/a\u003e  Lexicographic permutations \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the N\u003csup\u003eth\u003c/sup\u003e lexicographic permutation of the word \"abcdefghijklm\".\n___\n## \u003ca href=https://www.hackerrank.com/contests/projecteuler/challenges/euler025/problem?isFullScreen\u003e Problem 25: \u003c/a\u003e  N-digit Fibonacci number \u003csup\u003e[Easy]\u003c/sup\u003e\nFind the first term in the Fibonacci sequence to contain N digits.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaithbyte%2Fprojecteuler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffaithbyte%2Fprojecteuler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaithbyte%2Fprojecteuler/lists"}