Bert Peters e0e1bc26e8 Simplify implementation day 8
The second part doesn't actually need to start the search at the low
points; just iterating everything and keeping track of visited spaces is
enough.

Now that the iterator is only used in part 1, we inline the iterator to
remove some overhead from the code.
2021-12-09 12:02:07 +01:00
2021-11-22 18:51:59 +01:00
2016-12-01 11:25:19 +01:00
2019-02-19 15:38:11 +01:00
2018-01-27 22:25:25 +01:00
2019-08-22 12:42:46 +02:00
2021-10-29 08:30:21 +02:00
2021-04-05 21:18:21 +02:00
2021-12-09 12:02:07 +01:00
2021-12-05 11:31:14 +01:00
2015-12-04 22:26:39 +01:00
2021-11-29 20:31:29 +01:00

Advent of Code

Advent of Code 2021

This repository contains my solutions for Advent of Code. See:

Description
No description provided
Readme MIT 2.4 MiB
Languages
Rust 72.7%
Python 18.3%
HCL 3.5%
C 0.7%
Go 0.5%
Other 3.7%