CS Terms & Concepts | Daniel Greener-Vigil

Short, practical explainers on the computer science concepts that come up in interviews and code review.

May 29, 2026· 7 min read

Memoization vs. Dynamic Programming: What's the Difference?

Memoization and dynamic programming get treated as competing techniques when one is actually a form of the other. Here's the real relationship, with naive, memoized, and tabulated Fibonacci to make it concrete.

READ_POST

CS Terms & Concepts

March 27, 2026· 7 min read

What Is a Hash Map? How It Works Under the Hood

Hash maps give you O(1) average-case lookups almost for free. Here's the hashing, bucketing, and collision handling that actually makes that possible, built from scratch.

READ_POST

CS Terms & Concepts

January 23, 2026· 10 min read

Big O Notation, Explained for Interviews and Code Review

A practical guide to Big O notation: what it actually measures, the complexities you'll see most often, and how to reason about them without memorizing a cheat sheet.

READ_POST