Advent of Code 2024 Go - Day 4: Ceres Search

[@oliverhughes169]

Nice! Today I felt it was a clear win to use recursion. Pass your word, starting point, and the direction, and keep going until you reach a result. I could then use the same func for part 2, except only when the char is 'A', and pass an offset starting point in the characters diagonal to it.

[@benitoe.4878]

Did not know about the grid approach, thx. Got stuck constructing (sub)diagonals in [][]string in an attempt to search for full words.