How to Think About Algorithms and Big-O Before You Memorize a Single Formula
Big-O becomes useful once you stop treating it as notation to memorize and start using it to compare how algorithms behave as inputs grow.
2026-09-19
Topic Thread
#algorithms
3 published observations tracking this thread.
Graphs, BFS, and DFS: Learn the Frontier Before You Learn the Code
BFS and DFS are easier to remember when you think about the frontier of unexplored nodes rather than memorizing two code templates.
2026-09-19
Dynamic Programming Without the Magic: Think in States, Transitions, and Reuse
Dynamic programming is not a trick for hard-looking problems. It is a way to stop solving the same smaller problem repeatedly.
2026-09-19