{"id":21049917,"url":"https://github.com/mrpicklepinosaur/aoc2023","last_synced_at":"2026-05-20T17:04:17.169Z","repository":{"id":210672382,"uuid":"727143448","full_name":"MrPicklePinosaur/AoC2023","owner":"MrPicklePinosaur","description":"advent of code 2023 in ziglang","archived":false,"fork":false,"pushed_at":"2023-12-22T08:41:06.000Z","size":56,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-20T18:25:19.856Z","etag":null,"topics":["advent-of-code-2023","zig"],"latest_commit_sha":null,"homepage":"","language":"Zig","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/MrPicklePinosaur.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}},"created_at":"2023-12-04T09:19:47.000Z","updated_at":"2023-12-04T10:20:56.000Z","dependencies_parsed_at":"2023-12-17T07:37:24.161Z","dependency_job_id":null,"html_url":"https://github.com/MrPicklePinosaur/AoC2023","commit_stats":null,"previous_names":["mrpicklepinosaur/aoc2023"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MrPicklePinosaur%2FAoC2023","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MrPicklePinosaur%2FAoC2023/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MrPicklePinosaur%2FAoC2023/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MrPicklePinosaur%2FAoC2023/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MrPicklePinosaur","download_url":"https://codeload.github.com/MrPicklePinosaur/AoC2023/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243495497,"owners_count":20299923,"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":["advent-of-code-2023","zig"],"created_at":"2024-11-19T15:16:41.033Z","updated_at":"2025-12-27T21:35:31.874Z","avatar_url":"https://github.com/MrPicklePinosaur.png","language":"Zig","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\"\u003e\n\n# Advent of Code 2023\n\n\u003c/div\u003e\n\n## Writeups\n\n## Day1\n\nI have only had very minor exposure to programming in Zig, and was excited to\nlearn the language a lot better this year. Some immediate things that stood out\nto me was how much was checked by the compiler. It feels like a mini-rust of\nsorts. The optional and error types are also highly appreciated. Some slight\nannoyances with the langauge include unsued variables being a compile error and\nthe slightly wacky loops.\n\nIn part b, I also discovered that the sentinel value of a pointer or slice is\nalso included in the type, which I found pretty neat. The saturating\nsubtracting operator is also some nice sugar.\n\n## Day2\n\nDay 2 involved a bit of parsing. My solution for this just involved string\nsplitting over and over again. I wonder how efficient this is? Perhaps a better\napproach would be to make a single pass across the line using an iterator and\nhave a state machine to decide what we are parsing?\n\n## Day3\n\nDay 3 in all honesty gave me quite a hard time. This was perhaps due to lack of\nunderstanding of the containers in the standard library, leading to perhaps\nsome really bad code. I also struggled quite a lot with writing nice code using\nzig's loops, which behave slightly different to what you would expect from most\nother languages. I would like to revisit this question when I get a bit better\nat the language perhaps.\n\n## Day4\n\nPretty clean solution using hashmap to check for winning numbers. Second part\nof question was also a nice 1D DP solution. I did misunderstand the question\nand thought you win a copy of the card of the number that you matched, leading\nto an unnecessary topological sort implmenatation :P.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrpicklepinosaur%2Faoc2023","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmrpicklepinosaur%2Faoc2023","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrpicklepinosaur%2Faoc2023/lists"}