Algorithm you should know for preparing system design interview. For example, Learn Geohash / S2 Geometry algorithm for "How to design Uber like system?"
The algorithm and its resources should:
- Can answer a system design question. For instance, Building a complete Tweet index can answer "How to implement Twitter search" or "How to implement hashtag in Twitter".
- Free to read or watch.
- Text would be better than videos.
- Know when to use ☑️
- Know how it works ✅
- Bloom filter ✅
- Consistent hashing ✅
- Geohash / S2 Geometry ✅
- Leaky bucket / Token bucket ✅
- Inverted index ✅
- Distributed Consensus Algorithms (e.g., Paxos, Raft) ✅
- Cache Eviction Policies (e.g., LRU, LFU) ✅
- Rsync algorithm ✅
- HyperLogLog ✅
- Trie algorithm ✅
- Lossy Counting ☑️
- Frugal Streaming ☑️
- Operational transformation ☑️
- Quadtree / Rtree ☑️
- Ray casting ☑️
A Bloom filter is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set.
Consistent hashing is an algorithm designed to distribute data across a cluster in a way that minimizes re-distribution when nodes are added or removed. It is particularly useful in distributed systems, such as distributed caches, distributed storage systems, and load balancing.
Geohash can used by 1) dating apps to find romantic matches within a particular cell, and to create chat apps.2) Find nearby locations, and identify places of interest, restaurants, shops and accommodation establishments in an area. 3) Geohashers go on global expeditions to meet people and explore new places.
A mechanism to control the amount and the rate of the traffic sent to the network
- Everything You Need To Know About API Rate Limiting
- How to Design a Scalable Rate Limiting Algorithm
An inverted index is a data structure used primarily in text search engines.
Distributed consensus algorithm that enables nodes to agree on a value despite failures, requiring a majority for safety and progress.
Cache eviction policies determine which items to remove from a cache when it reaches its capacity, with common strategies including Least Recently Used (LRU), First In First Out (FIFO), and Least Frequently Used (LFU).
The rsync algorithm is a technique for reducing the cost of a file transfer by avoiding the transfer of blocks that are already at the destination.
HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset.
Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length)
- How to Design an Autocomplete System
- Spell Checkers
- prefix matching words (IP Addresses, Phone Numbers)
- Auto-complete feature using Trie
The lossy count algorithm is an algorithm to identify elements in a data stream whose frequency count exceed a user-given threshold.
- Fast and Reliable Ranking in Datastore
- Frequency Counts over Data Streams
- How we built rate limiting capable of scaling to millions of domains
- Rate-limiting strategies and techniques
Frugal Streaming uses only one unit of memory per group to compute a quantile for each group
Operational transformation (OT) is a technology for supporting a range of collaboration functionalities in advanced collaborative software systems.
- Spatial Indexing with Quadtrees
- Find nearby interest points
Ray casting is the most basic of many computer graphics rendering algorithms that use the geometric algorithm of ray tracing. Given a point with longitude and latitude, return the Country of the point.