BFS

Breadth-First Search, 广度优先搜索

• 12.5. Binary Tree Level Order Traversal II
• 14. Exhaustive Search
• 16.5. Bipartial Graph Part I
• 16.1. Find the Connected Component in the Undirected Graph
• 16.2. Route Between Two Nodes in Graph
• 16.3. Topological Sorting
• 16.4. Word Ladder

DFS

Depth-First Search, 深度优先搜索

• 12.4. Binary Tree Level Order Traversal
• 15.23. Longest Increasing Continuous subsequence
• 15.24. Longest Increasing Continuous subsequence II
• 15.4. Minimum Path Sum
• 15.1. Triangle
• 14. Exhaustive Search
• 14.12. Combinations
• 14.15. Minimum Depth of Binary Tree
• 14.11. Palindrome Partitioning
• 14.3. Permutations
• 14.1. Subsets
• 14.10. Unique Binary Search Trees II
• 14.2. Unique Subsets
• 14.16. Word Search
• 20.2.1. Problem A. Dynamic Grid
• 16.1. Find the Connected Component in the Undirected Graph
• 16.2. Route Between Two Nodes in Graph
• 16.3. Topological Sorting
• 10.14. Print Numbers by Recursion
• 7.11. Wildcard Matching

DP_Matrix

根据动态规划解题的四要素，矩阵类动态规划问题通常可用 f[x][y] 表示从起点走到坐标(x,y)的值

• 15.4. Minimum Path Sum
• 15.5. Unique Paths
• 15.6. Unique Paths II

DP_Sequence

单序列动态规划，通常使用 f[i] 表示前i个位置/数字/字母... 使用 f[n-1] 表示最后返回结果。

• 15. Dynamic Programming
• 15.10. Longest Increasing Subsequence
• 15.11. Palindrome Partitioning II
• 15.9. Word Break

DP_Two_Sequence

一般有两个数组或者两个字符串，计算其匹配关系. 通常可用 `f[i][j]`表示第一个数组的前 i 位和第二个数组的前 j 位的关系。

• 15.12. Longest Common Subsequence
• 15. Dynamic Programming
• 15.19. Distinct Subsequences
• 15.13. Edit Distance

TLE

Time Limit Exceeded 的简称。你的程序在 OJ 上的运行时间太长了，超过了对应题目的时间限制。

• 15.18. Best Time to Buy and Sell Stock IV
• 15.8. Jump Game
• 15.14. Jump Game II
• 15.4. Minimum Path Sum
• 15.11. Palindrome Partitioning II
• 16.4. Word Ladder
• 8.2. Zero Sum Subarray
• 11.15. Copy List with Random Pointer
• 11.17. Insertion Sort List
• 11.13. Merge k Sorted Lists
• 11.18. Palindrome Linked List
• 11.14. Reorder List
• 10.10. Hash Function
• 10.19. Ugly Number
• 7.9. Longest Palindromic Substring
• 7.4. Anagrams