diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index ba2163d8..7e88bd23 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -333,6 +333,7 @@ Leetcode
1009
101
1019
+1026
104
108
1089
@@ -340,6 +341,7 @@ Leetcode
11
110
112
+1147
118
1184
1189
@@ -348,6 +350,7 @@ Leetcode
1207
121
125
+1283
13
136
14
@@ -357,12 +360,15 @@ Leetcode
153
160
1653
+1657
169
1695
1704
173
1752
1769
+1833
+1838
189
190
191
@@ -372,7 +378,9 @@ Leetcode
2024
203
206
+2095
21
+2125
2130
215
217
@@ -381,6 +389,7 @@ Leetcode
2256
226
2270
+2279
230
2304
231
@@ -388,6 +397,8 @@ Leetcode
236
24
242
+2482
+2501
26
268
27
@@ -425,23 +436,27 @@ Leetcode
66
669
674
+684
7
700
701
704
709
+75
771
79
8
807
82
83
+841
852
876
9
901
905
917
+931
938
94
965
diff --git a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
index 9ca76362..c92f0981 100644
--- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
+++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
@@ -162,208 +162,210 @@ LeetCode Algorithm
66 | Plus One | C | Easy |
+75 | Sort Colors | C | Medium |
+
79 | Word Search | C | Medium |
-
+
82 | Remove Duplicates from Sorted List II | C | Medium |
-
+
83 | Remove Duplicates from Sorted List | C | Easy |
-
+
94 | Binary Tree Inorder Traversal | C | Medium |
-
+
98 | Validate Binary Search Tree | C | Medium |
-
+
101 | Symmetric Tree | C | Easy |
-
+
104 | Maximum Depth of Binary Tree | C | Easy |
-
+
108 | Convert Sorted Array to Binary Search Tree | C | Easy |
-
+
109 | Convert Sorted List to Binary Search Tree | C | Medium |
-
+
110 | Balanced Binary Tree | C | Easy |
-
+
112 | Path Sum | C | Easy |
-
+
118 | Pascal's Triangle | C | Easy |
-
+
121 | Best Time to Buy and Sell Stock | C | Easy |
-
+
125 | Valid Palindrome | C | Easy |
-
+
136 | Single Number | C | Easy |
-
+
141 | Linked List Cycle | C | Easy |
-
+
142 | Linked List Cycle II | C | Medium |
-
+
153 | Find Minimum in Rotated Sorted Array | C | Medium |
-
+
160 | Intersection of Two Linked Lists | C | Easy |
-
+
169 | Majority Element | C | Easy |
-
+
173 | Binary Search Tree Iterator | C | Medium |
-
+
189 | Rotate Array | C | Easy |
-
+
190 | Reverse Bits | C | Easy |
-
+
191 | Number of 1 Bits | C | Easy |
-
+
201 | Bitwise AND of Numbers Range | C | Medium |
-
+
203 | Remove Linked List Elements | C | Easy |
-
+
206 | Reverse Linked List | C | Easy |
-
+
215 | Kth Largest Element in an Array | C | Medium |
-
+
217 | Contains Duplicate | C | Easy |
-
+
223 | Rectangle Area | C | Medium |
-
+
226 | Invert Binary Tree | C | Easy |
-
+
230 | Kth Smallest Element in a BST | C | Medium |
-
+
231 | Power of Two | C | Easy |
-
+
234 | Palindrome Linked List | C | Easy |
-
+
236 | Lowest Common Ancestor of a Binary Tree | C | Medium |
-
+
242 | Valid Anagram | C | Easy |
-
+
268 | Missing Number | C | Easy |
-
+
274 | H-Index | C | Medium |
-
+
278 | First Bad Version | C | Easy |
-
+
283 | Move Zeroes | C | Easy |
-
+
287 | Find the Duplicate Number | C | Medium |
-
+
344 | Reverse String | C | Easy |
-
+
367 | Valid Perfect Square | C | Easy |
-
+
387 | First Unique Character in a String | C | Easy |
-
+
389 | Find the Difference | C | Easy |
-
+
404 | Sum of Left Leaves | C | Easy |
-
+
442 | Find All Duplicates in an Array | C | Medium |
-
+
461 | Hamming Distance | C | Easy |
-
+
476 | Number Complement | C | Easy |
-
+
509 | Fibonacci Number | C | Easy |
-
+
520 | Detect Capital | C | Easy |
-
+
561 | Array Partition I | C | Easy |
-
+
617 | Merge Two Binary Trees | C | Easy |
-
+
647 | Palindromic Substring | C | Medium |
-
+
669 | Trim a Binary Search Tree | C | Medium |
-
+
674 | Longest Continuous Increasing Subsequence | C | Easy |
-
+
684 | Redundant Connection | C | Medium |
-
+
700 | Search in a Binary Search Tree | C | Easy |
-
+
701 | Insert into a Binary Search Tree | C | Medium |
-
+
704 | Binary Search | C | Easy |
-
+
709 | To Lower Case | C | Easy |
-
+
771 | Jewels and Stones | C | Easy |
-
+
807 | Max Increase to Keep City Skyline | C | Medium |
-
+
841 | Keys and Rooms | C | Medium |
-
+
852 | Peak Index in a Mountain Array | C | Easy |
-
+
876 | Middle of the Linked List | C | Easy |
-
+
901 | Online Stock Span | C | Medium |
-
+
905 | Sort Array By Parity | C | Easy |
-
+
917 | Reverse Only Letters | C | Easy |
-
+
931 | Minimum Falling Path Sum | C | Medium |
-
+
938 | Range Sum of BST | C | Easy |
-
+
965 | Univalued Binary Tree | C | Easy |
-
+
977 | Squares of a Sorted Array | C | Easy |
-
+
985 | Sum of Even Numbers After Queries | C | Medium |
-
+
1009 | Complement of Base 10 Integer | C | Easy |
-
+
1026 | Maximum Difference Between Node and Ancestor | C | Medium |
-
+
1089 | Duplicate Zeros | C | Easy |
-
+
1147 | Longest Chunked Palindrome Decomposition | C | Hard |
-
+
1184 | Distance Between Bus Stops | C | Easy |
-
+
1189 | Maximum Number of Balloons | C | Easy |
-
+
1207 | Unique Number of Occurrences | C | Easy |
-
+
1283 | [Find the Smallest Divisor Given a Threshold]https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/description/) | C | Medium |
-
+
1657 | Determine if Two Strings Are Close | C | Medium |
-
+
1695 | Maximum Erasure Value | C | Medium |
-
+
1769 | Minimum Number of Operations to Move All Balls to Each Box | C | Medium |
-
+
1524 | Number of Sub-arrays With Odd Sum | C | Medium |
-
+
1653 | Minimum Deletions to Make String Balanced | C | Medium |
-
+
1704 | [Determine if String Halves Are Alike](Determine if String Halves Are Alike) | C | Easy |
-
+
1838 | Frequency of the Most Frequent Element | C | Medium |
-
+
1752 | Check if Array Is Sorted and Rotated | C | Easy |
-
+
1833 | Maximum Ice Cream Bars | C | Medium |
-
+
2024 | Maximize the Confusion of an Exam | C | Medium |
-
+
2095 | Delete the Middle Node of a Linked List | C | Medium |
-
+
2125 | Number of Laser Beams in a Bank | C | Medium |
-
+
2130 | Maximum Twin Sum of a Linked List | C | Medium |
-
+
2222 | Number of Ways to Select Buildings | C | Medium |
-
+
2256 | Minimum Average Difference | C | Medium |
-
+
2270 | Number of Ways to Split Array | C | Medium |
-
+
2279 | Maximum Bags With Full Capacity of Rocks | C | Medium |
-
-2304 | Minimum Path Cost in a Grid | C | Medium |
-2482 | Difference Between Ones and Zeros in Row and Column | C | Medium |
+2304 | Minimum Path Cost in a Grid | C | Medium |
+2482 | Difference Between Ones and Zeros in Row and Column | C | Medium |
+
2501 | Longest Square Streak in an Array | C | Medium |