Big-O Complexity: A Coding Interview Cheat Sheet

All the major Big-O complexity prep you need for a coding interview, on two pages. The growth ladder, what n fits in one second, data structures and sorting costs, graph algorithms, and a chart showing how the curves diverge. It ends with a five-step method for analyzing your solution out loud, with worked examples.