@@ -32,8 +32,8 @@ This command specifies the `english` branch and limit the depth of clone, get ri
3232 * [ Union-Find Application] ( think_like_computer/Union-Find-Application.md )
3333 * [ Find Sebesquence With Binary Search] ( interview/findSebesquenceWithBinarySearch.md )
3434 * [ Problems can be sloved by one line] ( interview/one-line-code-puzzles.md )
35- * [ How to Find Duplicate and Missing Element] ( interview/Find-Duplicate-and-Missing-Element.md )
36- * [ 如何判断回文链表 ] ( interview/判断回文链表 .md )
35+ * [ How to Find Dup and Missing Element] ( interview/Find-Duplicate-and-Missing-Element.md )
36+ * [ How to Check Palindrom LinkedList ] ( interview/check_palindromic_linkedlist .md )
3737
3838* II. Data Structure
3939 * [ Binary Head and Priority Queue] ( data_structure/binary_heap_implements_priority_queues.md )
@@ -43,9 +43,9 @@ This command specifies the `english` branch and limit the depth of clone, get ri
4343 * [ Special Data Structure: Monotonic Stack] ( data_structure/Monotonic_queue.md )
4444 * [ Design Twitter] ( data_structure/design_Twitter.md )
4545 * [ Reverse Part of Linked List via Recursion] ( data_structure/reverse_part_of_a_linked_list_via_recursion.md )
46+ * [ What's the Best Algo Book] ( think_like_computer/why_i_recommend_algs4.md )
4647 * [ Queue Implement Stack/Stack implement Queue] ( data_structure/ImplementQueueUsingStacksImplementStackUsingQueues.md )
4748 * [ 学习算法和刷题的思路指南] ( think_like_computer/学习数据结构和算法的高效方法.md )
48- * [ 学习数据结构和算法读什么书] ( think_like_computer/为什么推荐算法4.md )
4949
5050* III. Algorithmic thinking
5151 * [ My Way to Learn Algorithm] ( think_like_computer/ThewaytoAlgorithmlearning.md )
@@ -60,9 +60,9 @@ This command specifies the `english` branch and limit the depth of clone, get ri
6060 * [ Interval Scheduling: Intersections of Intervals] ( think_like_computer/IntervalIntersection.md )
6161 * [ String Multiplication] ( think_like_computer/string_multiplication.md )
6262 * [ Pancake Soring Algorithm] ( think_like_computer/PancakesSorting.md )
63- * [ Sliding Window Technique ] ( think_like_computer/滑动窗口技巧 .md )
64- * [ 常用的位操作 ] ( think_like_computer/常用的位操作 .md )
65- * [ 信封嵌套问题 ] ( think_like_computer/信封嵌套问题 .md )
63+ * [ Sliding Window Algorithm ] ( think_like_computer/SlidingWindowTechnique .md )
64+ * [ Some Useful Bit Manipulations ] ( think_like_computer/CommonBitManipulation .md )
65+ * [ Russian Doll Envelopes Problem ] ( think_like_computer/RussianDollEnvelopes .md )
6666 * [ 回溯算法团灭排列、组合、子集问题] ( interview/子集排列组合.md )
6767 * [ 几个反直觉的概率问题] ( think_like_computer/几个反直觉的概率问题.md )
6868 * [ 洗牌算法] ( think_like_computer/洗牌算法.md )
@@ -78,8 +78,8 @@ This command specifies the `english` branch and limit the depth of clone, get ri
7878 * [ The Strategies of Subsequence Problem] ( dynamic_programming/StrategiesForSubsequenceProblem.md )
7979 * [ Greedy: Interval Scheduling] ( dynamic_programming/IntervalScheduling.md )
8080 * [ 4 Keys Keyboard] ( dynamic_programming/FourKeysKeyboard.md )
81+ * [ What is DP Optimal Substructure] ( dynamic_programming/OptimalSubstructure.md )
8182 * [ 动态规划详解] ( dynamic_programming/动态规划详解进阶.md )
82- * [ 动态规划答疑篇] ( dynamic_programming/最优子结构.md )
8383 * [ 动态规划设计：最长递增子序列] ( dynamic_programming/动态规划设计：最长递增子序列.md )
8484 * [ 动态规划之KMP字符匹配算法] ( dynamic_programming/动态规划之KMP字符匹配算法.md )
8585 * [ 团灭 LeetCode 股票买卖问题] ( dynamic_programming/团灭股票问题.md )
@@ -89,5 +89,5 @@ This command specifies the `english` branch and limit the depth of clone, get ri
8989 * [ Difference Between Process and Thread in Linux] ( common_knowledge/linuxProcess.md )
9090 * [ You Must Know About Linux Shell] ( common_knowledge/linuxshell.md )
9191 * [ You Must Know About Cookie and Session] ( common_knowledge/SessionAndCookie.md )
92- * [ 加密算法的前身今世 ] ( common_knowledge/密码技术 .md )
93- * [ Git/SQL/正则表达式的在线练习平台 ] ( common_knowledge/在线练习平台 .md )
92+ * [ Cryptology Algorithm ] ( common_knowledge/Cryptology .md )
93+ * [ Some Good Online Pratice Platforms ] ( common_knowledge/OnlinePraticePlatform .md )
0 commit comments