| 二叉树 | 简单 | 二叉树的最大深度 | https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/↗ |
| 二叉树 | 简单 | 平衡二叉树 | https://leetcode-cn.com/problems/balanced-binary-tree/↗ |
| 二叉树 | 简单 | 路径总和 | https://leetcode-cn.com/problems/path-sum/↗ |
| 二叉树 | 简单 | 求根节点到叶节点数字之和 | https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/↗ |
| 二叉树 | 中等 | 完全二叉树的节点个数 | https://leetcode-cn.com/problems/count-complete-tree-nodes/↗ |
| 二叉树 | 中等 | 二叉搜索树的第k大节点 | https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/↗ |
| 二叉树 | 中等 | 二叉树的右视图 | https://leetcode-cn.com/problems/binary-tree-right-side-view/↗ |
| 二叉树 | 中等 | 从前序与中序遍历序列构造二叉树 | https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/↗ |
| 二叉树 | 中等 | 从中序与后序遍历序列构造二叉树 | https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/↗ |
| 链表 | 简单 | 合并两个有序链表 | https://leetcode-cn.com/problems/merge-two-sorted-lists/↗ |
| 链表 | 简单 | 删除链表的节点 | https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/↗ |
| 链表 | 简单 | 链表中倒数第k个节点 | https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/↗ |
| 链表 | 简单 | 从尾到头打印链表 | https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/↗ |
| 链表 | 简单 | 回文链表 | https://leetcode-cn.com/problems/palindrome-linked-list/↗ |
| 链表 | 中等 | 删除排序链表中的重复元素 II | https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/↗ |
| 栈&单调栈&队列 | 简单 | 用栈实现队列 | https://leetcode-cn.com/problems/implement-queue-using-stacks/↗ |
| 栈&单调栈&队列 | 简单 | 设计循环队列 | https://leetcode-cn.com/problems/design-circular-queue/↗ |
| 栈&单调栈&队列 | 中等 | 简化路径 | https://leetcode-cn.com/problems/simplify-path/↗ |
| 栈&单调栈&队列 | 中等 | 基本计算器 II | https://leetcode-cn.com/problems/basic-calculator-ii/↗ |
| 栈&单调栈&队列 | 中等 | 扁平化嵌套列表迭代器 | https://leetcode-cn.com/problems/flatten-nested-list-iterator/↗ |
| 栈&单调栈&队列 | 中等 | 移掉 K 位数字 | https://leetcode-cn.com/problems/remove-k-digits/↗ |
| 栈&单调栈&队列 | 中等 | 去除重复字母 | https://leetcode-cn.com/problems/remove-duplicate-letters/↗ |
| 栈&单调栈&队列 | 困难 | 直方图的水量 | https://leetcode-cn.com/problems/volume-of-histogram-lcci/↗ |
| 栈&单调栈&队列 | 困难 | 柱状图中最大的矩形 | https://leetcode-cn.com/problems/largest-rectangle-in-histogram/↗ |
| 栈&单调栈&队列 | 困难 | 计算器 | https://leetcode-cn.com/problems/calculator-lcci/↗ |
| 哈希表 | 简单 | 两数之和 | https://leetcode-cn.com/problems/two-sum/↗ |
| 哈希表 | 简单 | 数组中重复的数字 | https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/↗ |
| 哈希表 | 中等 | 连续数组 | https://leetcode-cn.com/problems/contiguous-array/↗ |
| 哈希表 | 中等 | 森林中的兔子 | https://leetcode-cn.com/problems/rabbits-in-forest/↗ |
| 哈希表 | 中等 | 字母异位词分组 | https://leetcode-cn.com/problems/group-anagrams/↗ |
| 二分查找 | 简单 | 二分查找 | https://leetcode-cn.com/problems/binary-search/↗ |
| 二分查找 | 中等 | 寻找旋转排序数组中的最小值 | https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/↗ |
| 二分查找 | 中等 | 寻找旋转排序数组中的最小值 II | https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/↗ |
| 二分查找 | 困难 | 分割数组的最大值 | https://leetcode-cn.com/problems/split-array-largest-sum/↗ |
| 二分查找 | 困难 | 寻找两个正序数组的中位数 | https://leetcode-cn.com/problems/median-of-two-sorted-arrays/↗ |
| 动态规划DP | 简单 | 最大子数组和 | https://leetcode-cn.com/problems/maximum-subarray/↗ |
| 动态规划DP | 中等 | 乘积最大子数组 | https://leetcode-cn.com/problems/maximum-product-subarray/↗ |
| 动态规划DP | 中等 | 打家劫舍 II | https://leetcode-cn.com/problems/house-robber-ii/↗ |
| 动态规划DP | 中等 | 目标和 | https://leetcode-cn.com/problems/target-sum/↗ |
| 动态规划DP | 中等 | 整数拆分 | https://leetcode-cn.com/problems/integer-break/↗ |
| 动态规划DP | 中等 | 最长公共子序列 | https://leetcode-cn.com/problems/longest-common-subsequence/↗ |
| 动态规划DP | 困难 | 吃掉 N 个橘子的最少天数 | https://leetcode-cn.com/problems/minimum-number-of-days-to-eat-n-oranges/↗ |
| 动态规划DP | 困难 | 编辑距离 | https://leetcode-cn.com/problems/edit-distance/↗ |
| 动态规划DP | 困难 | 不同的子序列 | https://leetcode-cn.com/problems/distinct-subsequences/↗ |
| 动态规划DP | 困难 | 正则表达式匹配 | https://leetcode-cn.com/problems/regular-expression-matching/↗ |
| 动态规划DP | 困难 | 统计全 1 子矩形 | https://leetcode-cn.com/problems/count-submatrices-with-all-ones/↗ |
| 回溯/DFS | 中等 | 子集 | https://leetcode-cn.com/problems/subsets/↗ |
| 回溯/DFS | 中等 | 括号生成 | https://leetcode-cn.com/problems/generate-parentheses/↗ |
| 回溯/DFS | 中等 | 复原 IP 地址 | https://leetcode-cn.com/problems/restore-ip-addresses/↗ |
| 回溯/DFS | 中等 | 字符串的排列 | https://leetcode-cn.com/problems/zi-fu-chuan-de-pai-lie-lcof/↗ |
| 回溯/DFS | 中等 | 被围绕的区域 | https://leetcode-cn.com/problems/surrounded-regions/↗ |
| 回溯/DFS | 困难 | 24 点游戏 | https://leetcode-cn.com/problems/24-game/↗ |
| 回溯/DFS | 困难 | 八皇后 | https://leetcode-cn.com/problems/eight-queens-lcci/↗ |
| 堆(优先队列) | 简单 | 最小K个数 | https://leetcode-cn.com/problems/smallest-k-lcci/↗ |
| 堆(优先队列) | 简单 | 最小的k个数 | https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/↗ |
| 排序&归并 | 中等 | 排序数组 | https://leetcode-cn.com/problems/sort-an-array/↗ |
| 排序&归并 | 简单 | 合并排序的数组 | https://leetcode-cn.com/problems/sorted-merge-lcci/↗ |
| 排序&归并 | 困难 | 数组中的逆序对 | https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/↗ |
| 字符串处理 | 简单 | 重复的子字符串 | https://leetcode-cn.com/problems/repeated-substring-pattern/↗ |
| 字符串处理 | 简单 | 反转字符串中的单词 III | https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/↗ |
| 字符串处理 | 简单 | 字符串压缩 | https://leetcode-cn.com/problems/compress-string-lcci/↗ |
| 字符串处理 | 中等 | 字符串转换整数 (atoi) | https://leetcode-cn.com/problems/string-to-integer-atoi/↗ |
| 字符串处理 | 困难 | 最小覆盖子串 | https://leetcode-cn.com/problems/minimum-window-substring/↗ |
| 数组&双指针 | 简单 | 汇总区间 | https://leetcode-cn.com/problems/summary-ranges/↗ |
| 数组&双指针 | 中等 | 轮转数组 | https://leetcode-cn.com/problems/rotate-array/↗ |
| 数组&双指针 | 中等 | 最大交换 | https://leetcode-cn.com/problems/maximum-swap/↗ |
| 位运算 | 简单 | 只出现一次的数字 | https://leetcode-cn.com/problems/single-number/↗ |
| 系统设计(缓存) | 中等 | LRU 缓存 | https://leetcode-cn.com/problems/lru-cache-lcci/↗ |
| 系统设计(缓存) | 困难 | LFU 缓存 | https://leetcode-cn.com/problems/lfu-cache/↗ |
| 随机&概率 | 中等 | 打乱数组 | https://leetcode-cn.com/problems/shuffle-an-array/↗ |
| 随机&概率 | 中等 | 用 Rand7() 实现 Rand10() | https://leetcode-cn.com/problems/implement-rand10-using-rand7/↗ |