> For the complete documentation index, see [llms.txt](https://emmaguo100.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://emmaguo100.gitbook.io/leetcode/ru-he-shua-ti.md).

# 如何刷题

recursion and backtracking

39 40 78 90 46 47

Graph Traversal: DFS/ BFS/ 

Dijkstra's algorithm

A\* (heuristic function)

133 126 490

Toplogical Sorting (Kann's algorithm)

210 269

Binary Tree

pre-order in-order Post-order

Divide and Conquer

94 236 297 102

Binary Search Tree

Binary search

34 162 69

\=============

Data Structure

**Hash Table**/ Queue /Stack / Heap （priority queue)

查找， 插入， 删除

242 133 127

155 225

215 23

Linked List

237 92 876 143

\================

Pointer manipulation (sliding window)

239 3 76

Sort (merge sort and quick sort 的区别）

148

convert real life problems to code

campus bike

146 1066 490

time/space complexity

DP (not too many questions in interviews) (空间换时间）

\=============================

高频率题

写自己的模板