Michael Bacarella @michael.bacarella.com · Dec 11 Advent of OCaml, day 11, solved! 😼 A welcome reprieve from yesterday. Today's solution can be solved quickly with "merely" coding interview level DFS graph search with memoization.
4 likes 2 replies
?
Replies
I used the exact same approach, also in #OCaml 😊 ! The only difference is that I convert all device names to consecutive integers in order to store the graph in a simple array for convenience. See here: code.up8.edu/pablo/aoc/-/...
from r/adventofcode