• 数据结构脑图
• 算法脑图

• Windows Microsoft New Terminal
• VS Code Themes
• 教你打造一款颜值逆天的 VS Code
• 炫酷的 VS Code 毛玻璃效果
• 自顶向下的编程方式

• 如何理解算法时间复杂度的表示法

• Master theorem

• 主定理

• Java 源码分析(ArrayList)

• Linked List 的标准实现代码

• Linked List 示例代码

• Java 源码分析(LinkedList)

• LRU Cache - Linked list: LRU 缓存机制

• Redis - Skip List:跳跃表、为啥 Redis 使用跳表(Skip List)而不是使用 Red-Black?

• https://leetcode-cn.com/problems/container-with-most-water/
• https://leetcode-cn.com/problems/move-zeroes/
• https://leetcode.com/problems/climbing-stairs/
• https://leetcode-cn.com/problems/3sum/ (高频老题)

• https://leetcode.com/problems/reverse-linked-list/
• https://leetcode.com/problems/swap-nodes-in-pairs
• https://leetcode.com/problems/linked-list-cycle
• https://leetcode.com/problems/linked-list-cycle-ii
• https://leetcode.com/problems/reverse-nodes-in-k-group/

• https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
• https://leetcode-cn.com/problems/rotate-array/
• https://leetcode-cn.com/problems/merge-two-sorted-lists/
• https://leetcode-cn.com/problems/merge-sorted-array/
• https://leetcode-cn.com/problems/two-sum/
• https://leetcode-cn.com/problems/move-zeroes/
• https://leetcode-cn.com/problems/plus-one/

• Java 的 PriorityQueue 文档
• Java 的 Stack 源码
• Java 的 Queue 源码
• Python 的 heapq
• 高性能的 container 库

• https://leetcode-cn.com/problems/valid-parentheses/
• https://leetcode-cn.com/problems/min-stack/
• https://leetcode-cn.com/problems/largest-rectangle-in-histogram
• https://leetcode-cn.com/problems/sliding-window-maximum
• https://leetcode.com/problems/design-circular-deque
• https://leetcode.com/problems/trapping-rain-water/

• Java Set 文档
• Java Map 文档

• https://leetcode-cn.com/problems/valid-anagram/description/
• https://leetcode-cn.com/problems/group-anagrams/
• https://leetcode-cn.com/problems/two-sum/description/

• 二叉搜索树 Demo
• 树的遍历 Demo

• https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
• https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
• https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/
• https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/
• https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/

递归代码模板

• https://leetcode-cn.com/problems/climbing-stairs/
• https://leetcode-cn.com/problems/generate-parentheses/
• https://leetcode-cn.com/problems/invert-binary-tree/description/
• https://leetcode-cn.com/problems/validate-binary-search-tree
• https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
• https://leetcode-cn.com/problems/minimum-depth-of-binary-tree
• https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/

• https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/
• https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
• https://leetcode-cn.com/problems/combinations/
• https://leetcode-cn.com/problems/permutations/
• https://leetcode-cn.com/problems/permutations-ii/

• 如何优雅地计算斐波那契数列

• 分治代码模板
• 括号生成问题
• 牛顿迭代法原理
• 牛顿迭代法代码

• https://leetcode-cn.com/problems/powx-n/
• https://leetcode-cn.com/problems/subsets/
• https://leetcode-cn.com/problems/majority-element/description/ (简单、但是高频)
• https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/
• https://leetcode-cn.com/problems/n-queens/

• DFS 代码模板(递归写法、非递归写法)
• BFS 代码模板

• https://leetcode-cn.com/problems/binary-tree-level-order-traversal/#/description
• https://leetcode-cn.com/problems/minimum-genetic-mutation/#/description
• https://leetcode-cn.com/problems/generate-parentheses/#/description
• https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/#/description
• https://leetcode-cn.com/problems/word-ladder/description/
• https://leetcode-cn.com/problems/word-ladder-ii/description/
• https://leetcode-cn.com/problems/number-of-islands/
• https://leetcode-cn.com/problems/minesweeper/description/

coin change 题目 动态规划定义

• https://leetcode-cn.com/problems/lemonade-change/description/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/description/
• https://leetcode-cn.com/problems/assign-cookies/description/
• https://leetcode-cn.com/problems/walking-robot-simulation/description/
• https://leetcode-cn.com/problems/jump-game/ 、 https://leetcode-cn.com/problems/jump-game-ii/

二分查找代码模板 Fast InvSqrt() 扩展阅读

• https://leetcode-cn.com/problems/sqrtx/
• https://leetcode-cn.com/problems/valid-perfect-square/
• https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
• https://leetcode-cn.com/problems/search-a-2d-matrix/
• https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
• 使用二分查找,寻找一个半有序数组 [4, 5, 6, 7, 0, 1, 2] 中间无序的地方

• 不同路径题目
• 不同路径 2 题目
• 最长公共子序列题目
• MIT 动态规划课程最短路径算法

• https://leetcode-cn.com/problems/climbing-stairs/description/
• https://leetcode-cn.com/problems/triangle/description/
• https://leetcode.com/problems/triangle/discuss/38735/Python-easy-to-understand-solutions-(top-down-bottom-up)
• https://leetcode-cn.com/problems/maximum-subarray/
• https://leetcode-cn.com/problems/maximum-product-subarray/description/
• https://leetcode-cn.com/problems/coin-change/description/

• https://leetcode-cn.com/problems/house-robber/
• https://leetcode-cn.com/problems/house-robber-ii/description/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/#/description
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/solution/yi-ge-fang-fa-tuan-mie-6-dao-gu-piao-wen-ti-by-l-3/

• https://leetcode-cn.com/problems/perfect-squares/
• https://leetcode-cn.com/problems/edit-distance/ (重点)
• https://leetcode-cn.com/problems/jump-game/
• https://leetcode-cn.com/problems/jump-game-ii/
• https://leetcode-cn.com/problems/unique-paths/
• https://leetcode-cn.com/problems/unique-paths-ii/
• https://leetcode-cn.com/problems/unique-paths-iii/
• https://leetcode-cn.com/problems/coin-change/
• https://leetcode-cn.com/problems/coin-change-2/

• https://leetcode-cn.com/problems/longest-valid-parentheses/
• https://leetcode-cn.com/problems/minimum-path-sum/
• https://leetcode-cn.com/problems/edit-distance/
• https://leetcode-cn.com/problems/decode-ways
• https://leetcode-cn.com/problems/maximal-square/
• https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/
• https://leetcode-cn.com/problems/frog-jump/
• https://leetcode-cn.com/problems/split-array-largest-sum
• https://leetcode-cn.com/problems/student-attendance-record-ii/
• https://leetcode-cn.com/problems/task-scheduler/
• https://leetcode-cn.com/problems/palindromic-substrings/
• https://leetcode-cn.com/problems/minimum-window-substring/
• https://leetcode-cn.com/problems/burst-balloons/

• 二叉树的层次遍历
• 实现 Trie
• Tire 树代码模板

• https://leetcode-cn.com/problems/implement-trie-prefix-tree/#/description
• https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/
• https://leetcode-cn.com/problems/word-search-ii/

岛屿数量 并查集代码模板

• https://leetcode-cn.com/problems/friend-circles
• https://leetcode-cn.com/problems/number-of-islands/
• https://leetcode-cn.com/problems/surrounded-regions/

• DFS 代码模板
• BFS 代码模板
• AlphaZero Explained
• 棋类复杂度

• https://leetcode-cn.com/problems/climbing-stairs/
• https://leetcode-cn.com/problems/generate-parentheses/
• https://leetcode-cn.com/problems/n-queens
• https://leetcode-cn.com/problems/valid-sudoku/description/
• https://leetcode-cn.com/problems/sudoku-solver/#/description

• https://leetcode-cn.com/problems/word-ladder/
• https://leetcode-cn.com/problems/minimum-genetic-mutation/

• A* 代码模板
• 相似度测量方法
• 二进制矩阵中的最短路径的 A* 解法
• 8 puzzles 解法比较

• https://leetcode-cn.com/problems/shortest-path-in-binary-matrix/
• https://leetcode-cn.com/problems/sliding-puzzle/
• https://leetcode-cn.com/problems/sudoku-solver/

https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree

N 皇后位运算代码示例

• https://leetcode-cn.com/problems/number-of-1-bits/
• https://leetcode-cn.com/problems/power-of-two/
• https://leetcode-cn.com/problems/reverse-bits/
• https://leetcode-cn.com/problems/n-queens/description/
• https://leetcode-cn.com/problems/n-queens-ii/description/
• https://leetcode-cn.com/problems/counting-bits/description/

• 布隆过滤器的原理和实现
• 使用布隆过滤器解决缓存击穿、垃圾邮件识别、集合判重
• 布隆过滤器 Python 代码示例
• 布隆过滤器 Python 实现示例
• 高性能布隆过滤器 Python 实现示例
• 布隆过滤器 Java 实现示例 1
• 布隆过滤器 Java 实现示例 2
• Let's implement a Bloom Filter
• Understanding the Meltdown exploit
• 替换算法总揽
• LRU Cache Python 代码示例

• https://leetcode-cn.com/problems/lru-cache/#/

• 十大经典排序算法
• 快速排序代码示例
• 归并排序代码示例
• 堆排序代码示例
• 直播课回顾: https://pan.baidu.com/s/1sFuZ8GjDCXy5mPCNLZhHxw 提取码: 2rdy
• 9 种经典排序算法可视化动画
• 6 分钟看完 15 种排序算法动画展示

• https://leetcode-cn.com/problems/relative-sort-array/
• https://leetcode-cn.com/problems/valid-anagram/
• https://leetcode-cn.com/problems/design-a-leaderboard/
• https://leetcode-cn.com/problems/merge-intervals/
• https://leetcode-cn.com/problems/reverse-pairs/

• 爬楼梯
• 不同路径
• 打家劫舍
• 最小路径和
• 股票买卖
• 使用最小花费爬楼梯
• 编辑距离

• https://leetcode-cn.com/problems/longest-increasing-subsequence/
• https://leetcode-cn.com/problems/decode-ways/
• https://leetcode-cn.com/problems/longest-valid-parentheses/
• https://leetcode-cn.com/problems/maximal-rectangle/
• https://leetcode-cn.com/problems/distinct-subsequences/
• https://leetcode-cn.com/problems/race-car/

• 不可变字符串
• Atoi 代码示例

• https://leetcode-cn.com/problems/to-lower-case/
• https://leetcode-cn.com/problems/length-of-last-word/
• https://leetcode-cn.com/problems/jewels-and-stones/
• https://leetcode-cn.com/problems/first-unique-character-in-a-string/
• https://leetcode-cn.com/problems/string-to-integer-atoi/

• https://leetcode-cn.com/problems/longest-common-prefix/description/
• https://leetcode-cn.com/problems/reverse-string
• https://leetcode-cn.com/problems/reverse-string-ii/
• https://leetcode-cn.com/problems/reverse-words-in-a-string/
• https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/
• https://leetcode-cn.com/problems/reverse-only-letters/

• https://leetcode-cn.com/problems/valid-anagram/
• https://leetcode-cn.com/problems/group-anagrams/
• https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/

• https://leetcode-cn.com/problems/valid-palindrome/
• https://leetcode-cn.com/problems/valid-palindrome-ii/
• https://leetcode-cn.com/problems/longest-palindromic-substring/

• https://leetcode-cn.com/problems/longest-common-subsequence/
• https://leetcode-cn.com/problems/edit-distance/
• https://leetcode-cn.com/problems/longest-palindromic-substring/

• https://leetcode-cn.com/problems/regular-expression-matching/
• https://leetcode-cn.com/problems/regular-expression-matching/solution/ji-yu-guan-fang-ti-jie-gen-xiang-xi-de-jiang-jie-b/
• https://leetcode-cn.com/problems/wildcard-matching/
• https://leetcode-cn.com/problems/distinct-subsequences/

• Boyer-Moore 算法
• Sunday 算法
• 字符串匹配暴力法代码示例
• Rabin-Karp 代码示例
• KMP 字符串匹配算法视频1
• KMP 字符串匹配算法视频2
• 字符串匹配的 KMP 算法

• https://leetcode-cn.com/problems/first-unique-character-in-a-string/
• https://leetcode-cn.com/problems/string-to-integer-atoi/
• https://leetcode-cn.com/problems/reverse-string-ii/
• https://leetcode-cn.com/problems/reverse-words-in-a-string/
• https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/
• https://leetcode-cn.com/problems/reverse-only-letters/
• https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/
• https://leetcode-cn.com/problems/longest-palindromic-substring/
• https://leetcode-cn.com/problems/isomorphic-strings/
• https://leetcode-cn.com/problems/valid-palindrome-ii/
• https://leetcode-cn.com/problems/wildcard-matching
• https://leetcode-cn.com/problems/longest-valid-parentheses
• https://leetcode-cn.com/problems/distinct-subsequences/