aboutsummaryrefslogtreecommitdiff
path: root/2025/README.md
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2025-12-07 09:14:27 +0100
committerSebastiano Tronto <sebastiano@tronto.net>2025-12-07 09:14:27 +0100
commiteb233235c876600bafa39a538d18ce11cfc72b39 (patch)
tree38f074d2e158d8109476d39ea6426ce8b60e98b2 /2025/README.md
parent61718ca8b469ebad7ed59da0ed3c167046cd8e57 (diff)
downloadaoc-eb233235c876600bafa39a538d18ce11cfc72b39.tar.gz
aoc-eb233235c876600bafa39a538d18ce11cfc72b39.zip
Clean up and alternative solution to day 7
Diffstat (limited to '2025/README.md')
-rw-r--r--2025/README.md4
1 files changed, 4 insertions, 0 deletions
diff --git a/2025/README.md b/2025/README.md
index c859ec8..4ca1d2e 100644
--- a/2025/README.md
+++ b/2025/README.md
@@ -96,3 +96,7 @@ changed to a map where the keys are the positions and the values are the
96number of multiverses where a tachyon is in that position. To update 96number of multiverses where a tachyon is in that position. To update
97this value for the current row, I sum the values of all tachyons that 97this value for the current row, I sum the values of all tachyons that
98end there from the previous row (that can be one or two tachyons). 98end there from the previous row (that can be one or two tachyons).
99
100I added a second solution for part 2 that does not use a map, but only
101lists. This could be seen as a dynamic programming problem where the
102iterative implementation is more intuitive than the recursive one.

Generated with cgit - Back to sebastiano.tronto.net