🌱 DSA (Beginner) · Warmup (Code Confidence) · cozy lesson
Big-O for Beginners
10 min · 1 min read · no scary math, promise
🤖
You’ve got this. Read a little, play a little — I’ll wait. No rush.
Stories
- O(1): locker combo — same time.
- O(n): read class list once.
- O(n log n): sort — divide + merge.
- O(n²): handshake everyone × everyone.
Interview rule: start O(n²), aim O(n) with map or O(n log n) with sort. Say space too: “O(n) extra for map.”
💛 Enjoying? Try 5 playful quizzes or watch it move.
Check your understanding
Correct answers earn XP (once each).
1. O(n²) means…
2. Hash lookup is…
My notes (saved in this browser)
Select text above → Save selection, or write your own. AlgoMaster-style notebook, local-first for MVP.
No notes yet. Your highlights will live here.
Finished reading? Seal it with a tick ✅
The checkbox in the explorer turns green too — same progress.