aoc2018

package

v0.0.0-...-984e56e Latest Latest Go to latest Published: Jul 26, 2026 License: MIT Imports: 5 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/janreggie/aoc

Links

Open Source Insights

README ¶

= Advent of Code 2018

== Progress

* [*] Day 1: Chronal Calibration
* [*] Day 2: Inventory Management System
* [ ] Day 3: No Matter How You Slice It
* [ ] Day 4: Repose Record
* [ ] Day 5: Alchemical Reduction
* [ ] Day 6: Chronal Coordinates
* [ ] Day 7: The Sum of Its Parts
* [ ] Day 8: Memory Maneuver
* [ ] Day 9: Marble Mania
* [ ] Day 10: The Stars Align
* [ ] Day 11: Chronal Charge
* [ ] Day 12: Subterranean Sustainability
* [ ] Day 13: Mine Cart Madness
* [ ] Day 14: Chocolate Charts
* [ ] Day 15: Beverage Bandits
* [ ] Day 16: Chronal Classification
* [ ] Day 17: Reservoir Research
* [ ] Day 18: Settlers of The North Pole
* [ ] Day 19: Go With The Flow
* [ ] Day 20: A Regular Map
* [ ] Day 21: Chronal Conversion
* [ ] Day 22: Mode Maze
* [ ] Day 23: Experimental Emergency Teleportation
* [ ] Day 24: Immune System Simulator 20XX
* [ ] Day 25: Four-Dimensional Adventure

Documentation ¶

Overview ¶

Package aoc2018 implements the solutions for Advent of Code 2018.

Index ¶

Variables
func Day01(input string) (answer1, answer2 string, err error)
func Day02(input string) (answer1, answer2 string, err error)
func Unimplemented(string) (string, string, error)

Constants ¶

This section is empty.

Variables ¶

View Source

var AllSolutions = []func(string) (string, string, error){
	Day01,
	Day02,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
	Unimplemented,
}

AllSolutions is the slice of all solutions so that they may be indexed easily. Note that slice index starts at 0 and not 1 so AllSolutions[0] is the solution for Day 1.

Functions ¶

func Day01 ¶

func Day01(input string) (answer1, answer2 string, err error)

Day01 solves the first day puzzle "Chronal Calibration".

Input ¶

A file containing 958 lines, each of which is either the character `+` or `-` followed by a number. For example:

-19
-18
+13
+14
+7
-3
+14
+5
-11
-13
-22
+4
+12

It is guaranteeed that these numbers will be no more than 100000 and will be no less than -100000.

func Day02 ¶

func Day02(input string) (answer1, answer2 string, err error)

Day02 solves the first day puzzle "Inventory Management System".

Input ¶

A file containing multiple lines, each containing a string of lowercase letters. For example:

abcdef
bababc
abbcde
abcccd
aabcdd
abcdee
ababab

func Unimplemented ¶

func Unimplemented(string) (string, string, error)

Unimplemented function returns an error simply stating unimplemented.

Types ¶

This section is empty.

Source Files ¶

View all Source files

Directories ¶

Path	Synopsis
binarytree

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL