课程笔记

算法基础

1. Recursion and Backtracking

2. Binary Search

3. Binary Tree (Divide & Conquer and Traverse)

4. Breadth-first Search

5. Depth-first Search

6. Linked List and Array

7. Two Pointers

8. Common Data Structures (Stack, Queue, Heap)

9. Dynamic Programming

算法强化

1. Union Find and Trie

2. Heap and Stack

3. Deque and Binary Search (Hard)

4. Dynamic Programming I (Sliding Array & Memoization)

5. Dynamic Programming II (Backpack)

6. Follow up Questions

系统设计

1. 第

2. 一

3. 节