- if every iteration has unique state => iterative
- if results can be reused => recursive + @cache
- maybe try going recursive first next time...
- go for the dumbest approach first
- even if it fails for part2, it's a helpful first step
- thinking about theoretical complexity for a minute might be a good idea
- e.g. I tried running a search for day 16, when e.g. Dijkstra is a better idea
-
Notifications
You must be signed in to change notification settings - Fork 0
mr-flannery/aoc24
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published