{"id":16830580,"url":"https://github.com/harmon758/project-euler","last_synced_at":"2025-03-22T04:30:36.801Z","repository":{"id":24491028,"uuid":"27895779","full_name":"Harmon758/Project-Euler","owner":"Harmon758","description":"Project Euler and ProjectEuler+ on HackerRank","archived":false,"fork":false,"pushed_at":"2024-03-25T00:35:44.000Z","size":7050,"stargazers_count":36,"open_issues_count":1,"forks_count":15,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-18T08:04:55.524Z","etag":null,"topics":["euler","euler-project","euler-solutions","hacker-rank","hackerrank","hackerrank-c","hackerrank-python","hackerrank-python-solutions","hackerrank-solutions","project-euler","project-euler-plus","project-euler-solutions","projecteuler","projecteuler-solutions"],"latest_commit_sha":null,"homepage":"https://projecteuler.net","language":"Python","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/Harmon758.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":"2014-12-11T22:53:52.000Z","updated_at":"2025-03-15T20:20:49.000Z","dependencies_parsed_at":"2023-09-23T00:30:57.345Z","dependency_job_id":"e8b401f6-5edb-4e62-8719-50a0bff687ce","html_url":"https://github.com/Harmon758/Project-Euler","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harmon758%2FProject-Euler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harmon758%2FProject-Euler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harmon758%2FProject-Euler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harmon758%2FProject-Euler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Harmon758","download_url":"https://codeload.github.com/Harmon758/Project-Euler/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244907420,"owners_count":20529850,"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":["euler","euler-project","euler-solutions","hacker-rank","hackerrank","hackerrank-c","hackerrank-python","hackerrank-python-solutions","hackerrank-solutions","project-euler","project-euler-plus","project-euler-solutions","projecteuler","projecteuler-solutions"],"created_at":"2024-10-13T11:39:51.672Z","updated_at":"2025-03-22T04:30:34.853Z","avatar_url":"https://github.com/Harmon758.png","language":"Python","readme":"[Project Euler](https://projecteuler.net) and\n[ProjectEuler+ on HackerRank](https://www.hackerrank.com/contests/projecteuler)\n===============================================================================\n\n| # | Name | Python | C | Notes |\n| ------------------------------------------------------------------------ | ----------------------------------------- | :-----: | :-----: | :-------- |\n| [1](001%20-%20Multiples%20of%203%20or%205) | Multiples of 3 or 5 | \u0026check; | \u0026check; | [^1] [^6] |\n| [2](002%20-%20Even%20Fibonacci%20Numbers) | Even Fibonacci Numbers | \u0026check; | \u0026check; | [^1] [^7] |\n| [3](003%20-%20Largest%20Prime%20Factor) | Largest Prime Factor | \u0026check; | | [^1] [^7] |\n| [4](004%20-%20Largest%20Palindrome%20Product) | Largest Palindrome Product | \u0026check; | \u0026check; | [^1] [^7] |\n| [5](005%20-%20Smallest%20Multiple) | Smallest Multiple | \u0026check; | \u0026check; | [^1] [^7] |\n| [6](006%20-%20Sum%20Square%20Difference) | Sum Square Difference | \u0026check; | | [^1] [^7] |\n| [7](007%20-%2010001st%20Prime) | 10001st Prime | \u0026check; | \u0026check; | [^1] [^7] |\n| [8](008%20-%20Largest%20Product%20in%20a%20Series) | Largest Product in a Series | \u0026check; | | [^1] [^7] |\n| [9](009%20-%20Special%20Pythagorean%20Triplet) | Special Pythagorean Triplet | \u0026check; | \u0026check; | [^1] [^7] |\n| [10](010%20-%20Summation%20of%20Primes) | Summation of Primes | \u0026check; | | [^1] [^7] |\n| [11](011%20-%20Largest%20Product%20in%20a%20Grid) | Largest Product in a Grid | \u0026check; | | [^1] [^7] |\n| [12](012%20-%20Highly%20Divisible%20Triangular%20Number) | Highly Divisible Triangular Number | \u0026check; | | [^1] [^7] |\n| [13](013%20-%20Large%20Sum) | Large Sum | \u0026check; | | [^1] [^7] |\n| [14](014%20-%20Longest%20Collatz%20Sequence) | Longest Collatz Sequence | \u0026check; | | [^1] [^7] |\n| [15](015%20-%20Lattice%20Paths) | Lattice Paths | \u0026check; | | [^2] [^7] |\n| [16](016%20-%20Power%20Digit%20Sum) | Power Digit Sum | \u0026check; | | [^1] [^7] |\n| [17](017%20-%20Number%20Letter%20Counts) | Number Letter Counts | \u0026check; | | [^2] [^8] |\n| [18](018%20-%20Maximum%20Path%20Sum%20I) | Maximum Path Sum I | \u0026check; | | [^1] [^7] |\n| [19](019%20-%20Counting%20Sundays) | Counting Sundays | \u0026check; | | [^1] |\n| [20](020%20-%20Factorial%20Digit%20Sum) | Factorial Digit Sum | \u0026check; | | [^1] [^7] |\n| [67](067%20-%20Maximum%20Path%20Sum%20II) | Maximum Path Sum II | \u0026check; | | [^3] [^7] |\n| [69](069%20-%20Totient%20Maximum) | Totient Maximum | \u0026check; | | [^2] [^7] |\n| [92](092%20-%20Square%20Digit%20Chains) | Square Digit Chains | \u0026check; | | [^2] [^7] |\n| [218](218%20-%20Perfect%20Right-angled%20Triangles) | Perfect Right-angled Triangles | \u0026cross; | \u0026cross; | [^4] [^7] |\n| [317](317%20-%20Firecracker) | Firecracker | \u0026check; | | [^5] |\n| [457](457%20-%20A%20Polynomial%20Modulo%20the%20Square%20of%20a%20Prime) | A Polynomial Modulo the Square of a Prime | | | [^5] |\n| [487](487%20-%20Sums%20of%20Power%20Sums) | Sums of Power Sums | | | [^5] |\n| [499](499%20-%20St.%20Petersburg%20Lottery) | St. Petersburg Lottery | \u0026check; | | [^5] |\n| [506](506%20-%20Clock%20Sequence) | Clock Sequence | \u0026check; | | [^5] |\n| [684](684%20-%20Inverse%20Digit%20Sum) | Inverse Digit Sum | \u0026check; | | [^5] |\n| [719](719%20-%20Number%20Splitting) | Number Splitting | \u0026check; | | [^5] |\n| [751](751%20-%20Concatenation%20Coincidence) | Concatenation Coincidence | \u0026check; | | [^5] |\n| [822](822%20-%20Square%20the%20Smallest) | Square the Smallest | \u0026check; | | [^5] |\n| [836](836%20-%20A%20Bold%20Proposition) | A Bold Proposition | \u0026cross; | \u0026cross; | [^4] [^5] |\n| [850](850%20-%20Fractions%20of%20Powers) | Fractions of Powers | | | [^5] |\n| [851](851%20-%20SOP%20and%20POS) | SOP and POS | | | [^5] |\n| [852](852%20-%20Coins%20in%20a%20Box) | Coins in a Box | | | [^5] |\n| [855](855%20-%20Delphi%20Paper) | Delphi Paper | | | [^5] |\n| [857](857%20-%20Beautiful%20Graphs) | Beautiful Graphs | | | [^5] |\n| [864](864%20-%20Square%20%2B%201%20%3D%20Squarefree) | Square + 1 = Squarefree | | | [^5] |\n| [867](867%20-%20Tiling%20Dodecagon) | Tiling Dodecagon | | | [^5] |\n| [870](870%20-%20Stone%20Game%20IV) | Stone Game IV | | | [^5] |\n| [876](876%20-%20Triplet%20Tricks) | Triplet Tricks | | | [^5] |\n| [879](879%20-%20Touch-screen%20Password) | Touch-screen Password | | | [^5] |\n| [880](880%20-%20Nested%20Radicals) | Nested Radicals | | | [^5] |\n| [881](881%20-%20Divisor%20Graph%20Width) | Divisor Graph Width | | | [^5] |\n| [882](882%20-%20Removing%20Bits) | Removing Bits | | | [^5] |\n| [883](883%20-%20Remarkable%20Triangles) | Remarkable Triangles | | | [^5] |\n\n[^1]: Project Euler Problem solved through ProjectEuler+ Challenge code\n[^2]: Project Euler Problem solved through ProjectEuler+ Challenge code, with adjustment of constant variable(s)\n[^3]: Project Euler Problem solved through ProjectEuler+ Challenge code, optionally using the file given as part of the problem\n[^4]: No code necessary\n[^5]: No corresponding ProjectEuler+ Challenge yet\n[^6]: Previously named \"Multiples of 3 and 5\": https://projecteuler.chat/viewtopic.php?t=7316.\n The ProjectEuler+ Challenge still has this name.\n[^7]: Project Euler Problem (Descriptions /) Titles previously did not use title case:\n https://web.archive.org/web/20230528105433/https://projecteuler.net/archives.\n This is still reflected in the ProjectEuler+ Challenge name.\n[^8]: The ProjectEuler+ Challenge has a different name: \"Number to Words\"\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharmon758%2Fproject-euler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fharmon758%2Fproject-euler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharmon758%2Fproject-euler/lists"}