ThinkerQAQ

Data Structures & Algorithms

237 notes

Some notes are currently available only in Chinese. English translations are shown when available.

  1. 2.10 heaphistorical

    Heap properties, max heap implementation, and min heap notes.

    数据结构
  2. 2.11 BitMaphistorical

    BitMap basics, example, and why it saves space.

    数据结构
  3. 2.12 BloomFilterhistorical

    Why BloomFilter is needed, how it works, use cases, and a Go implementation.

    数据结构
  4. 2.13 graphhistorical

    Graph basics, representations, traversal, and implementations.

    数据结构
  5. 2.14 UnionFindhistorical

    Union-Find, Quick Find, Quick Union, and optimizations.

    数据结构
  6. 2.15 LSMhistorical

    LSM basics, SSTables, operations, and comparison with B-trees.

    数据结构
  7. Longest Common Substringhistorical

    LeetCode notes on the Longest Common Substring problem.

    leetcode / 字符串
  8. 2.16 ziplisthistorical

    ziplist and why it saves memory.

    数据结构
  9. Longest Common Subsequencehistorical

    LeetCode notes on the Longest Common Subsequence problem.

    leetcode / 字符串
  10. 2.17 B Treehistorical

    B Tree, why it is used, and its relationship with B+ Tree.

    数据结构