{"id":19708810,"url":"https://github.com/willkill07/adventofcode2020","last_synced_at":"2026-03-04T12:02:23.980Z","repository":{"id":78761856,"uuid":"321793126","full_name":"willkill07/AdventOfCode2020","owner":"willkill07","description":null,"archived":false,"fork":false,"pushed_at":"2020-12-29T20:10:38.000Z","size":127,"stargazers_count":10,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-03-02T02:25:10.654Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Common Lisp","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/willkill07.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":"2020-12-15T21:27:44.000Z","updated_at":"2023-12-31T10:00:30.000Z","dependencies_parsed_at":"2023-02-24T08:45:21.379Z","dependency_job_id":null,"html_url":"https://github.com/willkill07/AdventOfCode2020","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/willkill07/AdventOfCode2020","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willkill07%2FAdventOfCode2020","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willkill07%2FAdventOfCode2020/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willkill07%2FAdventOfCode2020/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willkill07%2FAdventOfCode2020/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/willkill07","download_url":"https://codeload.github.com/willkill07/AdventOfCode2020/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/willkill07%2FAdventOfCode2020/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30079565,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-04T11:57:42.557Z","status":"ssl_error","status_checked_at":"2026-03-04T11:56:10.793Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":[],"created_at":"2024-11-11T21:45:00.318Z","updated_at":"2026-03-04T12:02:23.963Z","avatar_url":"https://github.com/willkill07.png","language":"Common Lisp","readme":"# Advent of Code 2020\n\nA Programming Language Per Day\n\n| Day | Language     | Notes                                                               |\n|:---:|:------------:|:--------------------------------------------------------------------|\n| 1   | x86 Assembly | Uses a recursive backtracking algorithm capable of any number count |\n| 2   | OCaml        | Uses no additional storage -- O(1) space -- but reads file twice    |\n| 3   | Awk          | Single pass through file, counting all tree collisions              |\n| 4   | Perl         | Regular expression all the things                                   |\n| 5   | Bash         | Only uses bash + coreutils (tr and echo are the only external cmds) |\n| 6   | Python       | Kakes use of generators and extensive list comprehensions           |\n| 7   | Julia        | Regex + comprehension for input. Sets for determining composition   |\n| 8   | Lua          | Translated from a javascript solution. My first lua program!        |\n| 9   | F#           | (Ab)using sequences for fun(ctional programming) and profit         |\n| 10  | Haskell      | Converted my OCaml solution to Haskell                              |\n| 11  | C            | Total of two dynamic memory allocations -- size is not hardcoded.   |\n| 12  | Swift        | Combination of Functional, Object-oriented, and fun with enums      |\n| 13  | Rust         | \"Sliding bus\" solver for part 2 rather than CRT                     |\n| 14  | Ruby         | Standard object-oriented Ruby                                       |\n| 15  | PHP          | Uses a closure to simplify implementation                           |\n| 16  | Lisp         | Brute force implementation using core Common Lisp                   |\n| 17  | C++          | Fully generic multidimensional code with hash sets for frontier     |\n| 18  | Flex + Bison | Building your own compiler counts as a language, right?             |\n| 19  | Kotlin       | Non-deterministic Push-down automata simulator!                     |\n| 20  | JavaScript*  | Detect locations of tiles, then construct, then search*             |\n| 21  | R            | Creates a new environment for the potential allergens + ingredients |\n| 22  | TypeScript   | Converted Javascript -\u003e Typescript                                  |\n| 23  | Scala        | No linked lists -- only arrays and fun in scala!                    |\n| 24  | C#           | LINQ where possible                                                 |\n| 25  | Java         | No real comments here. Pretty straight forward                      |\n\n`*` Still working on an cleaner solution to Part 2\n\nPotential Languages to Choose from (that I didn't...)\n- D - dev environment wasn't easy\n- Go - just didn't find a use\n- Prolog - i wanted to use prolog for a problem but I'm not used to parsing in prolog\n- TI-BASIC - for fun, I would definitely implement a day or two in TI-BASIC but input parsing?\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwillkill07%2Fadventofcode2020","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwillkill07%2Fadventofcode2020","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwillkill07%2Fadventofcode2020/lists"}