# System design algorithms

* 1\. Consistence Hashing
* 2\. Bloom Filters
* 3\. Skip Lists
* 4\. B-Tree
* 5\. LRU and LFU
* 6\. Reverse index
* 7\. Inverted index
* 8\. Trie algorithm
* 9\. Rsync algorithm
* 10\. Merkle tree
* 11\. Leaky bucket / Token bucket
* 12\. Geohash
* 13\. Quadtree
* 14\. Leader election
* 15\. Consensus (Raft/Paxos)
* 16\. Time synchronization
* 17\. Erasure coding
* 18\. Message digest algorithms
* 19\. Atomic commit
* 20\. Mutual exclusion
* 21\. Global state collection
* 22\. Gossip
* 23\. Replica management
* 24\. Self-stabilization
* 25\. HyperLoglog
* 26\. Count-min Sketch
* 27\. Hierarchical timing wheels
* 28\. Operational transformation (OT)
* 29\. Last Write Wins (LWW)
* 30\. Vector clocks


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://design.bea.ai/system-design-algorithms.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.