ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Subsetshistorical

    LeetCode notes on the Subsets problem.

    leetcode / 数组 / DFS / 全排列
  2. 3.14 Quick Sorthistorical

    Quick sort, its characteristics, partitions, and implementations.

    算法 / 排序
  3. Unique Pathshistorical

    LeetCode notes on the Unique Paths problem.

    leetcode / 数组 / DFS / 图遍历
  4. 3.15 Selection Sorthistorical

    Selection sort, its characteristics, process, and implementation.

    算法 / 排序
  5. Number of Islandshistorical

    LeetCode notes on the Number of Islands problem.

    leetcode / 数组 / DFS / 图遍历
  6. 3.16 Sortinghistorical

    Common sorting algorithms and a complexity comparison.

    算法 / 排序
  7. 4.1 Compare-and-Swap (CAS)historical

    The basic CAS semantics, use cases, ABA problem, and CPU atomic-instruction implementation.

  8. Maximal Squarehistorical

    LeetCode notes on the Maximal Square problem.

    leetcode / 数组 / DFS / 图遍历
  9. 4.2 Lock-Free Queuehistorical

    A historical CAS-based lock-free queue implementation note and its safe-memory-reclamation boundary.

  10. Course Schedulehistorical

    Course Schedule problem using DFS and BFS topological sorting.

    leetcode / 图