I'd love to learn about a Chinese Reminder Algorithm to stop forgetting so much stuff ;)
this post was submitted on 17 Dec 2024
23 points (100.0% liked)
Advent Of Code
920 readers
83 users here now
An unofficial home for the advent of code community on programming.dev!
Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.
AoC 2024
Solution Threads
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 |
Rules/Guidelines
- Follow the programming.dev instance rules
- Keep all content related to advent of code in some way
- If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2024 Day 10])
- When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts
Relevant Communities
Relevant Links
Credits
Icon base by Lorc under CC BY 3.0 with modifications to add a gradient
console.log('Hello World')
founded 1 year ago
MODERATORS
Regular expressions
- A* algorithm
- honestly a lot of other graph algorithms, just be aware of them, and be able to find algorithms you didn't know before
- OEIS
- SMT solvers
- set operations on intervals
I followed the link for Spectral Decomposition, and noped right out when I saw the banner "This article may be too technical for most readers to understand."
Great list though, thanks!
Not an algorithm or theorem, but specializing to the input is a good general tip to at least get an answer ime
In terms of algorithms: flood fill is useful, a few other graph algos like min-cut/max-flow come in useful sometimes.