{"id":22401175,"url":"https://github.com/guillaumedd/adventofcode2015","last_synced_at":"2025-03-27T00:24:36.215Z","repository":{"id":75992287,"uuid":"48590642","full_name":"GuillaumeDD/AdventOfCode2015","owner":"GuillaumeDD","description":"This project provides solutions to the Advent of Code 2015.","archived":false,"fork":false,"pushed_at":"2015-12-27T10:28:56.000Z","size":114,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-01T06:12:44.895Z","etag":null,"topics":["advent-of-code-2015","algorithm-challenges","scala"],"latest_commit_sha":null,"homepage":"","language":"Scala","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GuillaumeDD.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"COPYING","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-12-25T20:28:38.000Z","updated_at":"2017-08-02T10:11:43.000Z","dependencies_parsed_at":"2023-03-16T09:30:41.502Z","dependency_job_id":null,"html_url":"https://github.com/GuillaumeDD/AdventOfCode2015","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/GuillaumeDD%2FAdventOfCode2015","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuillaumeDD%2FAdventOfCode2015/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuillaumeDD%2FAdventOfCode2015/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuillaumeDD%2FAdventOfCode2015/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GuillaumeDD","download_url":"https://codeload.github.com/GuillaumeDD/AdventOfCode2015/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245757168,"owners_count":20667300,"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-2015","algorithm-challenges","scala"],"created_at":"2024-12-05T08:43:49.780Z","updated_at":"2025-03-27T00:24:36.185Z","avatar_url":"https://github.com/GuillaumeDD.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Description #\nThis project provides solutions to the [Advent of Code 2015](http://adventofcode.com).\n\n# Installation #\nYou can run the solutions via [SBT](http://www.scala-sbt.org/).\n\nFirst, compile the solutions:\n\n\t$ sbt compile\n\nThen, you can  run the solution to a specific  problem. For instance, to\nrun the solution for the part 1 of day 1:\n\n\t$ sbt \"runMain aoc.day01.Part1\" \u003c src/main/resources/day01/input\n\t\nTo run the solution for the part 2 of day 1:\n\n\t$ sbt \"runMain aoc.day01.Part2\" \u003c src/main/resources/day01/input\n\n# Notes about the Provided Solutions #\n1. Day 1: Not Quite Lisp\n1. Day 2: I Was Told There Would Be No Math\n1. Day 3: Perfectly Spherical Houses in a Vacuum\n1. Day 4: The Ideal Stocking Stuffer\n1. Day 5: Doesn't He Have Intern-Elves For This?\n   + Usage of regular expressions and backreferences\n1. Day 6: Probably a Fire Hazard\n1. Day 7: Some Assembly Required\n1. Day 8: Matchsticks\n1. Day 9: All in a Single Night\n   + Brute force approach\n1. Day 10: Elves Look, Elves Say\n1. Day 11: Corporate Policy\n   + Usage of regular expressions and backreferences\n1. Day 12: JSAbacusFramework.io\n   + Usage of spray.json library\n1. Day 13: Knights of the Dinner Table\n   + Similar approach to day 9\n1. Day 14: Reindeer Olympics\n1. Day 15: Science for Hungry People\n1. Day 16: Aunt Sue\n1. Day 17: No Such Thing as Too Much\n1. Day 18: Like a GIF For Your Yard\n1. Day 19: Medicine for Rudolph\n   + Part 2 implements a solution using an A* algorithm\n1. Day 20: Infinite Elves and Infinite Houses\n   + Solutions runs slowly.\n1. Day 21: RPG Simulator 20XX\n1. Day 22: Wizard Simulator 20XX\n1. Day 23: Opening the Turing Lock\n1. Day 24: It Hangs in the Balance\n   + This solution proceeds by building a first group by ascending\n     size and by ascending quantum entanglement. Then it checks that\n     the other groups can be built so that all groups have the same\n     weight.\n   + It takes a few seconds to compute the solution\n1. Day 25: Let It Snow \n\n# License #\nGPLv3 - see the COPYING file.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fguillaumedd%2Fadventofcode2015","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fguillaumedd%2Fadventofcode2015","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fguillaumedd%2Fadventofcode2015/lists"}