DSA Patterns • Week 1–201 / 13Big-O, time & space complexity crash courseHashing trades memory for time — O(n²) lookup becomes O(n).StackShade deckPredict → explain → retrieve