dsa2 min read
Shuffle an Array — Fisher-Yates O(n) Uniform Shuffle [Google Easy]
Implement Fisher-Yates shuffle for uniform random permutation. Every arrangement is equally probable. O(n) time O(1) extra space.
Read →
Randomization
2 articles
dsa2 min read
Random Pick Index — Reservoir Sampling
Pick a random index of a target value with equal probability using reservoir sampling over the array.
Read →