Algorithmic Complexity & Code-Level Optimization Questions

Reasoning about the time and space complexity of code and applying local optimizations that materially change performance. Covers Big-O analysis and performance modeling, data-structure selection, hot-loop and allocation reduction, and knowing when an algorithmic change beats micro-optimization. Emphasizes performance-aware coding grounded in complexity rather than premature tuning.