{"id":37864788,"url":"https://github.com/raeperd/advent-of-code","last_synced_at":"2026-01-16T16:36:08.877Z","repository":{"id":327078472,"uuid":"1107770369","full_name":"raeperd/advent-of-code","owner":"raeperd","description":null,"archived":false,"fork":false,"pushed_at":"2025-12-03T14:37:46.000Z","size":39,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-12-04T04:52:23.490Z","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/raeperd.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-12-01T15:34:35.000Z","updated_at":"2025-12-03T14:37:50.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/raeperd/advent-of-code","commit_stats":null,"previous_names":["raeperd/advent-of-code"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/raeperd/advent-of-code","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raeperd%2Fadvent-of-code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raeperd%2Fadvent-of-code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raeperd%2Fadvent-of-code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raeperd%2Fadvent-of-code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/raeperd","download_url":"https://codeload.github.com/raeperd/advent-of-code/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raeperd%2Fadvent-of-code/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28479961,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-16T11:59:17.896Z","status":"ssl_error","status_checked_at":"2026-01-16T11:55:55.838Z","response_time":107,"last_error":"SSL_read: 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":"2026-01-16T16:36:08.092Z","updated_at":"2026-01-16T16:36:08.856Z","avatar_url":"https://github.com/raeperd.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Advent of Code 2025\n\nSolutions for [Advent of Code 2025](https://adventofcode.com/) in Python.\n\n## 01\n- edge case on starting from 0\n- + and - handling for mod\n- simple while can fix issue\n- linear thinking for circular problems - count multiples crossed instead of simulating\n- integer division for boundaries - `(n // 100) * 100` finds nearest multiples\n\n## 02\n- care max number of partition\n- `for-else` - detects loop completion without break\n- divisibility filters patterns early - `len % k == 0` before checking\n\n## 03\n- finding max value, greedy might work\n- suffix constraint - when picking k items, leave room for remaining picks\n- greedy works for lex-max - highest digit first always wins\n\n## 04\n- variable scope matters - reset counter per cell, not per row\n- only check target cells (`@`), not all cells in grid\n- 8-direction neighbor check - tuple iteration `(di, dj)` with bounds checking\n- repeated removal - loop until no changes in a pass ","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraeperd%2Fadvent-of-code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraeperd%2Fadvent-of-code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraeperd%2Fadvent-of-code/lists"}