Introduction to Algorithms
Core Takeaway: Transitioned from intuitive heuristic problem-solving to rigorous mathematical analysis of asymptotic bounds and invariants.
Key Highlights: Peak-finding in O(log n), AVL tree balancing via rotations, dynamic programming subproblems (memoization vs bottom-up DAG topological order), and shortest path heuristics.
"The course reshaped how I structure database queries, manage cache invalidations, and analyze time-space trade-offs in backend systems."