package
0.0.0-20221226200024-9483a1acf98a
Repository: https://github.com/antonkosov/advent-of-code-2016.git
Documentation: pkg.go.dev

# README

--- Part Two --- Of course, if you leave the cleaning robot somewhere weird, someone is bound to notice.

What is the fewest number of steps required to start at 0, visit every non-0 number marked on the map at least once, and then return to 0?