Week
Big-O, Arrays, and Strings
Build a reliable cost model, then learn the state, pointer, accumulation, and boundary patterns that make array and string solutions predictable.
- 01 Big-O and JavaScript's Hidden CostsLearn to describe growth, price every operation inside a loop, and defend a complexity analysis. 55 min
- 02 Arrays and Immutable StringsUnderstand the JavaScript operations beneath array and string interview solutions. 50 min
- 03 Remembering What You Have SeenReplace repeated searches with three reusable questions: have I seen it, how often, and which partner is needed? 65 min
- 04 In-Place Array PatternsUse read/write boundaries and safe traversal direction to transform arrays without losing unread values. 70 min
- 05 Prefix, Suffix, and One-Pass StateSummarize the past so each position can be answered without rescanning the array. 65 min
- 06 Matrix Boundaries and TransformationsTurn grid traversal into explicit shrinking boundaries and verify in-place transformations geometrically. 65 min