In computer science, O(1) describes an operation whose cost stays the same no matter how large the data gets. That is where the name constime comes from: constant time. Everything else, usually, is O(n).
Here you will find notes on architecture, storage internals and distributed systems: how databases, runtimes and services really work beneath the code we write every day, and what every choice costs in time, memory and complexity.
Every article starts from a video and contains its reworked transcript, so you can choose to watch, read or do both. Longer topics become series meant to be followed in order.