ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Longest Substring Without Repeating Charactershistorical

    LeetCode notes on the longest substring without repeating characters.

    leetcode / 字符串
  2. 2.18 Sparse Indexhistorical

    Sparse indexes and comparison with dense indexes.

    数据结构
  3. 2.19 Indexhistorical

    What an index is, index types, implementations, and selection considerations.

    数据结构
  4. 2.20 Inverted Indexhistorical

    Forward index and inverted index.

    数据结构
  5. 3.1 Cache Replacement Policieshistorical

    FIFO, LRU, LFU, and related cache replacement policies.

    算法
  6. 3.2 Dynamic Programminghistorical

    Dynamic programming steps and a path-counting example.

    算法
  7. 3.3 Greedyhistorical

    Greedy choices with loading, coin change, and 0-1 knapsack examples.

    算法
  8. 3.4 Divide and Conquerhistorical

    Divide a problem into smaller subproblems, solve them, and derive the original solution.

    算法
  9. 3.5 Recursionhistorical

    Recursion, its call process, basic ideas, examples, conversion to iteration, and tail recursion.

    算法
  10. Edit Distancehistorical

    LeetCode notes on the Edit Distance problem.

    leetcode / 字符串