{"id":19135931,"url":"https://github.com/glasstoestudio/adventofcode_2021","last_synced_at":"2026-06-19T15:32:53.820Z","repository":{"id":44708121,"uuid":"433255361","full_name":"GlassToeStudio/AdventOfCode_2021","owner":"GlassToeStudio","description":null,"archived":false,"fork":false,"pushed_at":"2025-03-11T12:19:12.000Z","size":136591,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-11-13T15:07:15.643Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/GlassToeStudio.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}},"created_at":"2021-11-30T01:40:02.000Z","updated_at":"2025-03-11T12:19:16.000Z","dependencies_parsed_at":"2022-09-13T22:12:43.170Z","dependency_job_id":null,"html_url":"https://github.com/GlassToeStudio/AdventOfCode_2021","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GlassToeStudio/AdventOfCode_2021","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlassToeStudio%2FAdventOfCode_2021","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlassToeStudio%2FAdventOfCode_2021/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlassToeStudio%2FAdventOfCode_2021/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlassToeStudio%2FAdventOfCode_2021/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GlassToeStudio","download_url":"https://codeload.github.com/GlassToeStudio/AdventOfCode_2021/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlassToeStudio%2FAdventOfCode_2021/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34538219,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-19T02:00:06.005Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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-09T06:32:40.640Z","updated_at":"2026-06-19T15:32:53.794Z","avatar_url":"https://github.com/GlassToeStudio.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Advent Of Code 2021\nAdvent of Code 2021: https://adventofcode.com/2021\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 1: Sonar Sweep\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nFrom a list of numbers (depths), count how many depths are greater than the previous depth.\n\n```\n199 (N/A - no previous measurement)\n200 (increased)\n208 (increased)\n210 (increased)\n200 (decreased)\n207 (increased)\n240 (increased)\n269 (increased)\n260 (decreased)\n263 (increased)\n```\n\n### Part 1:\nCount how many increases in depth there are. \n\n### Part 2:\nTake the sum of every three consecutive depths and then count the increases in the sums.\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 2: Dive!\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nFrom a list of directions and amounts (course), calculate the\ndepth and distance traveled.\n\n```\nforward 5\ndown 5\nforward 8\nup 3\ndown 8\nforward 2\n```\n\n### Part 1:\nCalculate the product of the final depth and distance.\n\n### Part 2:\nCalculate depth by using an aiming factor based on distance.\nCalculate the product of the final depth and distance.\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 3: Binary Diagnostic\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nFrom a list of binary numbers, perform some operations\nto determine most common and least common bits at index.\nThese are used to create two new binary numbers.\n\n```\n00100\n11110\n10110\n10111\n10101\n01111\n00111\n11100\n10000\n11001\n00010\n01010\n```\n\n### Part 1:\nConstruct a binary number based on the most common bit at \nindex for each number in the list.\nConstruct a binary number based on the least common bit at \nindex for each number in the list. (opposite of previous number)\n\nFInd the product of those two numbers.\n\n### Part 2:\nThis time you find the most common bit at index for a copy of the list of numbers, but remove any number that does not have that bit at that index. And the least common bit at index for a copy of the original list and\nremove any numbers that do not have that bit at that index.\n\nKeep doing that for the modified list until one number remains.\n\nGet the product of the two final numbers.\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 4: Giant Squid\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nPlay BINGO!\nFrom list of balls chosen, and a set of many bingo boards,\nfind the bingo boards that are winners.\n\n```\n7,4,9,5,11,17,23,2,0,14,21,24,10,16,13,6,15,25,12,22,18,20,8,19,3,26,1\n\n22 13 17 11  0\n 8  2 23  4 24\n21  9 14 16  7\n 6 10  3 18  5\n 1 12 20 15 19\n\n 3 15  0  2 22\n 9 18 13 17  5\n19  8  7 25 23\n20 11 10 24  4\n14 21 16 12  6\n\n14 21 17 24  4\n10 16 15  9 19\n18  8 23 26 20\n22 11 13  6  5\n 2  0 12  3  7\n```\n\n### Part 1:\nFind the first winning bingo board to beat the giant squid.\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://github.com/GlassToeStudio/AdventOfCode_2021/blob/master/Day_04/Giant_Squid_Bingo.gif\" width=\"85%\" height=\"85%\"\n\u003c/p\u003e\n\n### Part 2:\nFind the last winning bingo board to insure the giant squid wins.\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 5: Hydrothermal Venture\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nGiven a set of line segments as two points, graph each line segment.\n\n```\n0,9 -\u003e 5,9\n8,0 -\u003e 0,8\n9,4 -\u003e 3,4\n2,2 -\u003e 2,1\n7,0 -\u003e 7,4\n6,4 -\u003e 2,0\n0,9 -\u003e 2,9\n3,4 -\u003e 1,4\n0,0 -\u003e 8,8\n5,5 -\u003e 8,2\n```\n\n### Part 1:\nGraph each point the line segment covers. Find all areas that have at least 1 overlap. Only consider horizontal and vertical lines.\n\n### Part 2:\nGraph each point the line segment covers. Find all areas that have at least 1 overlap. Consider horizontal, vertical lines and diagnoanl lines..\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://github.com/GlassToeStudio/AdventOfCode_2021/blob/master/Day_05/day_05_vis_large.png\" width=\"50%\" height=\"50%\"\n\u003c/p\u003e\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 6: Lanternfish\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nFish everywhere. Given a set of data: a list of numbers, each number represents how long until the fish reproduces. A fish reproduces once every 7 days. New born fish take 8 days for their first offspring. Find the number of fish after n days.\n\n```\nInitial state: 3,4,3,1,2\nAfter  1 day:  2,3,2,0,1\nAfter  2 days: 1,2,1,6,0,8\nAfter  3 days: 0,1,0,5,6,7,8\nAfter  4 days: 6,0,6,4,5,6,7,8,8\nAfter  5 days: 5,6,5,3,4,5,6,7,7,8\nAfter  6 days: 4,5,4,2,3,4,5,6,6,7\nAfter  7 days: 3,4,3,1,2,3,4,5,5,6\nAfter  8 days: 2,3,2,0,1,2,3,4,4,5\nAfter  9 days: 1,2,1,6,0,1,2,3,3,4,8\nAfter 10 days: 0,1,0,5,6,0,1,2,2,3,7,8\nAfter 11 days: 6,0,6,4,5,6,0,1,1,2,6,7,8,8,8\nAfter 12 days: 5,6,5,3,4,5,6,0,0,1,5,6,7,7,7,8,8\nAfter 13 days: 4,5,4,2,3,4,5,6,6,0,4,5,6,6,6,7,7,8,8\nAfter 14 days: 3,4,3,1,2,3,4,5,5,6,3,4,5,5,5,6,6,7,7,8\nAfter 15 days: 2,3,2,0,1,2,3,4,4,5,2,3,4,4,4,5,5,6,6,7\nAfter 16 days: 1,2,1,6,0,1,2,3,3,4,1,2,3,3,3,4,4,5,5,6,8\nAfter 17 days: 0,1,0,5,6,0,1,2,2,3,0,1,2,2,2,3,3,4,4,5,7,8\nAfter 18 days: 6,0,6,4,5,6,0,1,1,2,6,0,1,1,1,2,2,3,3,4,6,7,8,8,8,8\n```\n\n### Part 1:\nFind a way to simulate lanternfish. How many lanternfish would there be after\n80 days?\n\n### Part 2:\nHow many lanternfish would there be after 256 days?\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 7: The Treachery of Whales\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 8: Seven Segment Search\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 9: Smoke Basin\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://github.com/GlassToeStudio/AdventOfCode_2021/blob/master/Day_09/heightmap_large.png\" width=\"50%\" height=\"50%\"\n\u003c/p\u003e\n\n### Part 2:\nPart 2 description\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://github.com/GlassToeStudio/AdventOfCode_2021/blob/master/Day_09/images/heightmap-lava-fill-animated.gif\" width=\"50%\" height=\"50%\"\n\u003c/p\u003e\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 10: Syntax Scoring\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://github.com/GlassToeStudio/AdventOfCode_2021/blob/master/Day_10/day_10_1.gif\" width=\"50%\" height=\"50%\"\n\u003c/p\u003e\n\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 11: Dumbo Octopus\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 12: Passage Pathing\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 13: Transparent Origami\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 14: Extended Polymerization\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 15: Chiton\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 16: Packet Decoder\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 17: Trick Shot\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 18: Snailfish\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 19: Beacon Scanner\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 20: Trench Map\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eJOIN US\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 22: Reactor Reboot\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 18: Snailfish\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 23: Amphipod\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 24: Arithmetic Logic Unit\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e\n\n\n\n\u003cdetails\u003e\n\u003csummary\u003e\u003cb\u003eDay 25: Sea Cucumber\u003c/b\u003e\u003c/summary\u003e\n\u003cp\u003e\nOverall description\n\n```\n\n```\n\n### Part 1:\nPart 1 description\n\n### Part 2:\nPart 2 description\n\n\u003c/p\u003e\n\u003c/details\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglasstoestudio%2Fadventofcode_2021","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fglasstoestudio%2Fadventofcode_2021","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglasstoestudio%2Fadventofcode_2021/lists"}