CompSci and My Day Job
summary
Walks through real problems and concrete fixes: building a headless e-commerce cart in Elixir with Redis leads to choosing a hash so individual items are O(1) instead of scanning sets; database lookups use indexes and become log n (binary search: log2(1,000)=10, a million ≈17) versus costly full table scans; naive Fibonacci recursion explodes exponentially (FIB 40 ≈1s, FIB 48 stalls) and becomes linear with dynamic programming; precompute nightly association tables to avoid factorial explosion, or use greedy heuristics (~75% of optimal).
AI-written summary · about
chapters (17)
- 0:00Start
- 3:46DATA STRUCTURES
- 8:17MORE REALISTIC
- 8:46LET'S TRY A HASH
- 11:40DEDUPLICATION?
- 21:31EFFICIENCY GAIN?
- 22:38IN THE REAL WORLD
- 23:52EMBARRASSMENT
- 31:17TAIL RECURSION
- 34:18EXPONENTIAL PAIN
- 39:58SPOT THE PROBLEMS
- 41:41HANSELMAN'S FINGERS
- 43:02SOUNDS LIKE KNAPSACK TO ME
- 43:56SIGNATURE PROBLEMS
- 44:54I SMELL BIN PACKING
- 46:14BRUTE FORCE
- 46:55GREEDY, NEAREST NEIGHBOR
related talks
52mCompSci and My Day Job
26mBeyond the code: Rediscovering the timeless skills of software engineering in the AI era
37mRefactoring the Technical Interview
28mBeyond the code: Rediscovering the timeless skills of software engineering in the AI era
49mTeaching functional programming to noobs
26mStaying ahead of the curve
53mStaying Ahead of the Curve
38mDont.