CompSci and My Day Job

on YouTube ↗52m

" summary

Builds an Elixir + Redis example and shows why the right Redis type matters: lists behave like stacks/queues (LPUSH/LPOP semantics), sets force full deserialization if you need single-item updates, and hashes give order one per-SKU lookups so cart updates are constant time. Demonstrates Postgres b‑tree indexes as a log N win (log2(1000) ≈ 10), warns how naive nested loops become N^2 or exponential (Fibonacci spikes to hundreds of seconds by n≈48), and describes caching results weekly to avoid deadly combinatorial work.

AI-written summary · about

" chapters (11)

1. 0:00Start
2. 6:03DATA STRUCTURES
3. 11:19LET'S TRY A SET
4. 27:47EFFICIENCY GAIN?
5. 28:24CONSTANT TIME
6. 29:44IN THE REAL WORLD
7. 30:48EMBARRASSMENT
8. 38:31EXPONENTIAL PAIN
9. 44:57HANSELMAN'S FINGERS
10. 47:06SIGNATURE PROBLEMS
11. 49:26BRUTE FORCE

" related talks

• 50mCompSci and My Day JobRob Conery · NDC London 2019
• 53mStaying Ahead of the CurveTrisha Gee · GOTO Berlin 2014
• 43mJust for Fun: Rediscovering Coding as a HobbyAdam Keys · RubyConf 2009
• 28mBeyond the code: Rediscovering the timeless skills of software engineering in the AI eraChris Chakrit Riddhagni · XConf APAC 2025 | Singapore
• 31mCode to JoyAvdi Grimm · GoGaRuCo 2012
• 19mPanel: Elixir AdoptionShanti Chellaram, Brandon Richey · EMPEX LA 2018
• 26mBeyond the code: Rediscovering the timeless skills of software engineering in the AI eraChris Chakrit Riddhagni · XConf Lite Vietnam 2025
• 01h 01mDown the Rabbit Hole: An Exploration of Stack Overflow QuestionsMarshall Clow · CppCon 2021