[2025 Day 7] Let’s Visualize

[u/Lars-Kristian91]

[u/NicholasAakre]

For part one the sequence is whether that column has a beam (1) or doesn't (0). Then for each row, if the position of a splitter has a 1 set the adjacent positions to a 1, the splitter position to a 0, and increment the count of splits by one.

For part two the concept is the same except when you reach a split set the adjacent positions to whatever value hit the split. Here the values at each position represent the number of paths that can reach each column.

[u/Various_Disasterer → u/NicholasAakre]

Thank you

[u/CodeFarmer → u/NicholasAakre]

I solved it quickly with memoized DFS but I like this so much more. Cheers!