Baby steps go a long way: Induction and Limits to infinity and beyond

Big-O notation - the art of being precisely imprecise

Maximum Subarray Sum - Different approaches, different runtimes!

Search & Sorting Algorithms (and why you shouldn’t use most of them)

Trees: Getting to the root of efficiency.

DP: It’s not hoarding if it’s subproblems.

DP: ‘Take it or leave it’ has never been so optimal.

Graphs: Where burning bridges is a valid strategy.

DFS: For when you really need to get to the bottom of things.