1.1 Data Structures and Algorithms

1. Data Structures

1.1. Array

• array.md

1.2. Linked List

• linkedlist.md

1.3. Stack

• stack.md

1.4. Queue

• queue.md

1.5. Heap

• heap.md

1.6. Tree

• tree.md

1.7. Graph

• graph.md

1.8. Hash Table

• hashmap.md

1.9. Set

• set.md

1.10. BitMap

• BitMap.md

1.11. Skip List

• Skip List.md

1.12. ziplist

• ziplist.md

1.13. Union Find

• UnionFind.md

1.14. LSM

LSM.md

1.15. Sparse Index

Sparse Index.md

2. Algorithms

2.1. Sorting

• Sorting.md

2.2. Search

• Binary Search.md
• Linear Search.md

2.3. BloomFilter

• BloomFilter.md

2.4. Cache Replacement Policies

• Cache Replacement Policies.md

2.5. Recursion

• Recursion.md

2.6. Dynamic Programming

• Dynamic Programming.md

2.7. Greedy

• Greedy.md

2.8. Divide and Conquer

• Divide and Conquer.md

2.9. Backtracking

• Backtracking.md

2.10. DFS

• DFS.md

3. Problem Solving

3.1. How to Practice

• Master a basic programming language
  • Java
• Build a deep understanding of fundamental data structures
  • Time and space complexity analysis
• Practice systematically by module
  • DFS, BFS, HashMap, etc.

3.2. Sword Offer

• Sword Offer Online Programming + Solutions — NowCoder

3.3. LeetCode

• LeetCode HOT 100

4. References

• Mastering Data Structures and Algorithms — Jiang Hao’s Blog
• Falling in Love with Data Structures (Season 1 + 2) — Jerry House
• python-data-structure-cn · GitBook (Legacy)
• Graph Algorithms — mike_jun’s Blog
• CodeTop Company Question Bank