Basic Trie tree

content/posts/leetcode/binary-tree-top-down-dfs.md

@@ -5,6 +5,8 @@ tags = [ "dfs" ]
 categories = [ "LeetCode" ]
 +++
 
+[二叉树题单](https://leetcode.cn/circle/discuss/K0n2gO/)
+
 1. [104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/)
 
 深度从根开始往下递增，到达叶子的时候，深度达到最深，更新答案。

content/posts/leetcode/consider-by-bit.md

@@ -5,6 +5,8 @@ tags = [ "bitmasks" ]
 categories = [ "LeetCode" ]
 +++
 
+[位运算题单](https://leetcode.cn/circle/discuss/dHn9Vk/)
+
 1. [477. 汉明距离总和](https://leetcode.cn/problems/total-hamming-distance/)
 
 先考虑两个数字的情况，按位考虑，如果二进制位不同，那么对答案的贡献是 1.

content/posts/leetcode/fast-slow-pointers-in-list.md

@@ -6,6 +6,8 @@ categories = [ "LeetCode" ]
 draft = true
 +++
 
+[链表题单](https://leetcode.cn/circle/discuss/K0n2gO/)
+
 1. [876. 链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/)
 
 神奇的技巧。

content/posts/leetcode/pvp-heap.md

@@ -5,6 +5,8 @@ tags = [ "heap" ]
 categories = [ "LeetCode" ]
 +++
 
+[数据结构题单](https://leetcode.cn/circle/discuss/mOr1u6/)
+
 1. [2102. 序列顺序查询](https://leetcode.cn/problems/sequentially-ordinal-rank-tracker/)
 
 维护一个小顶堆 `q1`，代表前 `k` 大的元素。

content/posts/leetcode/reverse-linked-list.md

@@ -5,6 +5,8 @@ tags = [ "linked list" ]
 categories = [ "LeetCode" ]
 +++
 
+[链表题单](https://leetcode.cn/circle/discuss/K0n2gO/)
+
 1. [206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/)
 
 p1 指向前一个节点，p2 指向当前节点，p3 指向下一个节点。

content/posts/leetcode/sliding-window-max-min.md

@@ -5,6 +5,8 @@ tags = [ "two pointers" ]
 categories = [ "LeetCode" ]
 +++
 
+[滑动窗口题单](https://leetcode.cn/circle/discuss/0viNMK/)
+
 1. [3. 无重复字符的最长子串](https://leetcode.cn/problems/longest-substring-without-repeating-characters/)
 
 维护一个不定长的滑动窗口：