onyx-and-iris 22b442171b add point subpackage ... build ShortestPath as ordered map replace dijkstra in part two with a bfs		2024-12-19 21:32:21 +00:00
day-01	rename data to buf	2024-12-06 19:57:07 +00:00
day-02	rename data to buf	2024-12-06 19:57:07 +00:00
day-03	rename data to buf	2024-12-06 19:57:07 +00:00
day-04	rename data to buf	2024-12-06 19:57:07 +00:00
day-05	implement using custom sort function on an update struct	2024-12-09 01:05:54 +00:00
day-06	remove const obstacle	2024-12-06 23:31:22 +00:00
day-07	return early if total exceeds target	2024-12-07 23:47:20 +00:00
day-08	no need to check outofbounds here	2024-12-08 21:46:44 +00:00
day-09	range over numEmptyBlocks	2024-12-19 20:35:46 +00:00
day-10	use endpoints map to keep score (size of map)	2024-12-10 23:07:05 +00:00
day-11	add result struct to package one	2024-12-12 02:53:33 +00:00
day-12	and a little more	2024-12-13 23:40:43 +00:00
day-13	refactor a little	2024-12-13 20:36:10 +00:00
day-14	remove print graph	2024-12-14 19:34:28 +00:00
day-15	add day-15 part2 + benchmarks	2024-12-18 14:45:27 +00:00
day-16	use already calculated one.LowestCost	2024-12-19 02:44:26 +00:00
day-17	add day-17 + benchmarks	2024-12-18 15:02:35 +00:00
day-18	add point subpackage	2024-12-19 21:32:21 +00:00
day-19	run part one with goroutines	2024-12-19 19:03:30 +00:00
.gitignore	add day-09 + benchmarks	2024-12-10 21:42:26 +00:00
scaffold.sh	rename data to buf	2024-12-06 19:57:07 +00:00