Explainers

Explainers

Data structures and algorithms

What is a hash map?
A hashmap stores pairs of keys and values. A key identifies an entry, and its value is the information stored there.
What is binary search?
Binary search finds a value in a sorted array by comparing it with the middle element, which rules out half of the array, and repeating the same step on the…
What is a prefix sum?
A prefix sum is the sum of the first few values of an array: the first one, the first two, the first three, and so on.
What is a sliding window?
A sliding window is a range of consecutive positions that moves through an array from left to right.
What is Big O notation?
Big O notation describes how fast the number of operations grows as the input gets larger.
What is dynamic programming?
Dynamic programming (DP) solves a problem by solving smaller versions of the same problem first.
What is union-find (disjoint set union)?
Union-find, also called a disjoint-set union (DSU), is a data structure that keeps a collection of elements divided into groups, with every element in exactly…

System design

What is backpressure?
Backpressure is feedback that makes a producer reduce its output when a downstream consumer cannot keep up.
What is a back-of-envelope estimate?
Capacity estimation translates user activity into the rates and volumes a design must support.
What is consistent hashing? Ultra Premium lesson
Place keys on a hash ring so adding or removing a server moves only a small share of them.