I’ll start with what I do not mean by this question. I know you need to know programming and data structures, but what I am asking about is specific algorithms and theorems.
The ones I can enumerate now (edited after some answers):
- BFS
- DFS
- Dijkstra’s algorithm
- Chinese Reminder Theorem
- Dynamic Programming with memoisation or tabularisation
- operations on linked lists
- binary search
- Interval arithmetic
- GCD and LCM
- bitwise operations
- Topological sorting
- Shoelace formula
- mod inverse
- Linear algebra
- Priority queues
- Parsing algos
- Spectral decomposition
You must log in or register to comment.
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!
Regular expressions
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.
I’d love to learn about a Chinese Reminder Algorithm to stop forgetting so much stuff ;)
- 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
