fix readme

Author: geemaple

README.md

@@ -20,10 +20,6 @@ python problem.py https://leetcode.com/problems/online-stock-span/
 python problem.py https://www.lintcode.com/problem/92 -l cpp
 ```
 
-## 文章/Articles
-- [Blog博客](http://geemaple.github.io/category/#Algobase)
-- [Youtube频道](https://www.youtube.com/@GeekPal)
-
 ## 书籍/Books
 - 《算法技术手册》/ Algorithms in a Nutshell
 - 《STL源码剖析》/ The Annotated STL Sources
@@ -48,9 +44,8 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 - [Union Find](#union-find)
 - [Trie](#trie)
 - [Linked List](#linked-list)
-- [String](#string)
-- [Array](#array)
 - [Other](#other)
+- [Unknown](#unknown)
 
 ## Bit Manipulation
 ## Simulation
@@ -91,14 +86,23 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [Leetcode-2529. Maximum Count Of Positive Integer And Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/description/) | [c++](./leetcode/2529.maximum-count-of-positive-integer-and-negative-integer.cpp), [python](./leetcode/2529.maximum-count-of-positive-integer-and-negative-integer.py) | O\(logN\) | O\(1\) | std::lower\_bound | - |
 
 ## Two Pointers
+| Problem | Solution | Time | Space | Note | Ref |
+| ----- | ----- | ----- | ----- | ----- | ----- |
+| [Leetcode-658. Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/description/) | [c++](./leetcode/658.find-k-closest-elements.cpp), [python](./leetcode/658.find-k-closest-elements.py) | O\(Log\(N \- K\)\) | O\(1\) | Range | - |
+
 ## Greedy
+| Problem | Solution | Time | Space | Note | Ref |
+| ----- | ----- | ----- | ----- | ----- | ----- |
+| [Leetcode-3048. Earliest Second To Mark Indices I](https://leetcode.com/problems/earliest-second-to-mark-indices-i/description/) | [c++](./leetcode/3048.earliest-second-to-mark-indices-i.cpp), [python](./leetcode/3048.earliest-second-to-mark-indices-i.py) | O\(M\*logM\) | O\(M\) | \- | - |
+
 ## Dynamic Programming
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-120. Triangle](https://leetcode.com/problems/triangle/description/) | [c++](./leetcode/120.triangle.cpp), [python](./leetcode/120.triangle.py) | O\(N^2\) | O\(N\) | \- | - |
 | [Leetcode-1575. Count All Possible Routes](https://leetcode.com/problems/count-all-possible-routes/description/) | [c++](./leetcode/1575.count-all-possible-routes.cpp), [python](./leetcode/1575.count-all-possible-routes.py) | \- | \- | \- | - |
 | [Leetcode-375. Guess Number Higher Or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/description/) | [c++](./leetcode/375.guess-number-higher-or-lower-ii.cpp), [python](./leetcode/375.guess-number-higher-or-lower-ii.py) | O\(N^3\) | O\(N^2\) | DP\(Index\) | - |
 | [Leetcode-322. Coin Change](https://leetcode.com/problems/coin-change/description/) | [c++](./leetcode/322.coin-change.cpp), [python](./leetcode/322.coin-change.py) | O\(K \* N\) | O\(N\) | Index | [Video](https://youtu.be/EjMjlFjLRiM) |
+| [Leetcode-300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/description/) | [c++](./leetcode/300.longest-increasing-subsequence.cpp), [python](./leetcode/300.longest-increasing-subsequence.py) | O\(N\*logN\) | O\(N\) | LIS \| std::lower\_bound | - |
 
 ## Backtracking
 | Problem | Solution | Time | Space | Note | Ref |
@@ -110,23 +114,29 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Lintcode-1534. Convert Binary Search Tree To Sorted Doubly Linked List](https://www.lintcode.com/problem/convert-binary-search-tree-to-sorted-doubly-linked-list) | [c++](./lintcode/1534.convert-binary-search-tree-to-sorted-doubly-linked-list.cpp), [python](./lintcode/1534.convert-binary-search-tree-to-sorted-doubly-linked-list.py) | O\(N\) | O\(Height\) | BST \| Leetcode\-426 | - |
 | [Lintcode-11. Search Range In Binary Search Tree](https://www.lintcode.com/problem/search-range-in-binary-search-tree) | [c++](./lintcode/11.search-range-in-binary-search-tree.cpp), [python](./lintcode/11.search-range-in-binary-search-tree.py) | O\(N\) | O\(Height\) | InOrder | - |
+| [Leetcode-240. Search A 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/description/) | [c++](./leetcode/240.search-a-2d-matrix-ii.cpp), [python](./leetcode/240.search-a-2d-matrix-ii.py) | O\(m \* logN\) | O\(1\) | Matrix | - |
 
 ## Breadth-First Search
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
+| [Leetcode-322. Coin Change](https://leetcode.com/problems/coin-change/description/) | [c++](./leetcode/322.coin-change.cpp), [python](./leetcode/322.coin-change.py) | O\(K \* N\) | O\(N\) | Index | [Video](https://youtu.be/EjMjlFjLRiM) |
 | [Leetcode-102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) | [c++](./leetcode/102.binary-tree-level-order-traversal.cpp), [python](./leetcode/102.binary-tree-level-order-traversal.py) | O\(N\) | O\(Width\) | Level | - |
 | [Leetcode-104. Maximum Depth Of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) | [c++](./leetcode/104.maximum-depth-of-binary-tree.cpp), [python](./leetcode/104.maximum-depth-of-binary-tree.py) | O\(N\) | O\(Height\) | Recursion | - |
+| [Leetcode-297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) | [c++](./leetcode/297.serialize-and-deserialize-binary-tree.cpp), [python](./leetcode/297.serialize-and-deserialize-binary-tree.py) | O\(N\) | O\(N\) | Serialization | - |
 
 ## Depth-First Search
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
+| [Leetcode-257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/description/) | [c++](./leetcode/257.binary-tree-paths.cpp), [python](./leetcode/257.binary-tree-paths.py) | O\(N\) | O\(Height\) | \- | - |
 | [Leetcode-98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/) | [c++](./leetcode/98.validate-binary-search-tree.cpp), [python](./leetcode/98.validate-binary-search-tree.py) | O\(N\) | O\(Height\) | BST | - |
 | [Leetcode-94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/description/) | [c++](./leetcode/94.binary-tree-inorder-traversal.cpp), [python](./leetcode/94.binary-tree-inorder-traversal.py) | O\(N\) | O\(Height\) | InOrder | - |
 | [Leetcode-145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/description/) | [c++](./leetcode/145.binary-tree-postorder-traversal.cpp), [python](./leetcode/145.binary-tree-postorder-traversal.py) | O\(N\) | O\(Height\) | PostOrder | - |
 | [Leetcode-114. Flatten Binary Tree To Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/) | [c++](./leetcode/114.flatten-binary-tree-to-linked-list.cpp), [python](./leetcode/114.flatten-binary-tree-to-linked-list.py) | O\(N\) | O\(Height\) | PreOrder | - |
 | [Leetcode-144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/description/) | [c++](./leetcode/144.binary-tree-preorder-traversal.cpp), [python](./leetcode/144.binary-tree-preorder-traversal.py) | O\(N\) | O\(Height\) | PreOrder | - |
+| [Leetcode-104. Maximum Depth Of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) | [c++](./leetcode/104.maximum-depth-of-binary-tree.cpp), [python](./leetcode/104.maximum-depth-of-binary-tree.py) | O\(N\) | O\(Height\) | Recursion | - |
 | [Leetcode-110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/description/) | [c++](./leetcode/110.balanced-binary-tree.cpp), [python](./leetcode/110.balanced-binary-tree.py) | O\(N\) | O\(Height\) | Recursion | - |
 | [Leetcode-236. Lowest Common Ancestor Of A Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/) | [c++](./leetcode/236.lowest-common-ancestor-of-a-binary-tree.cpp), [python](./leetcode/236.lowest-common-ancestor-of-a-binary-tree.py) | O\(N\) | O\(Height\) | Recursion | - |
+| [Leetcode-297. Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) | [c++](./leetcode/297.serialize-and-deserialize-binary-tree.cpp), [python](./leetcode/297.serialize-and-deserialize-binary-tree.py) | O\(N\) | O\(N\) | Serialization | - |
 
 ## Hash Table
 | Problem | Solution | Time | Space | Note | Ref |
@@ -136,25 +146,31 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 ## Binary Search Tree
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
+| [Leetcode-98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/) | [c++](./leetcode/98.validate-binary-search-tree.cpp), [python](./leetcode/98.validate-binary-search-tree.py) | O\(N\) | O\(Height\) | BST | - |
+| [Lintcode-1534. Convert Binary Search Tree To Sorted Doubly Linked List](https://www.lintcode.com/problem/convert-binary-search-tree-to-sorted-doubly-linked-list) | [c++](./lintcode/1534.convert-binary-search-tree-to-sorted-doubly-linked-list.cpp), [python](./lintcode/1534.convert-binary-search-tree-to-sorted-doubly-linked-list.py) | O\(N\) | O\(Height\) | BST \| Leetcode\-426 | - |
 | [Leetcode-450. Delete Node In A Bst](https://leetcode.com/problems/delete-node-in-a-bst/description/) | [c++](./leetcode/450.delete-node-in-a-bst.cpp), [python](./leetcode/450.delete-node-in-a-bst.py) | O\(Height\) | O\(Height\) | Delete | - |
+| [Leetcode-173. Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/description/) | [c++](./leetcode/173.binary-search-tree-iterator.cpp), [python](./leetcode/173.binary-search-tree-iterator.py) | O\(1\) | O\(Height\) | InOrder | - |
+| [Lintcode-11. Search Range In Binary Search Tree](https://www.lintcode.com/problem/search-range-in-binary-search-tree) | [c++](./lintcode/11.search-range-in-binary-search-tree.cpp), [python](./lintcode/11.search-range-in-binary-search-tree.py) | O\(N\) | O\(Height\) | InOrder | - |
 | [Leetcode-701. Insert Into A Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/description/) | [c++](./leetcode/701.insert-into-a-binary-search-tree.cpp), [python](./leetcode/701.insert-into-a-binary-search-tree.py) | O\(Height\) | O\(Height\) | Insert | - |
 | [Lintcode-448. Inorder Successor In Bst](https://www.lintcode.com/problem/inorder-successor-in-bst) | [c++](./lintcode/448.inorder-successor-in-bst.cpp), [python](./lintcode/448.inorder-successor-in-bst.py) | O\(Height\) | O\(1\) | Successor \| Leetcode\-285 | - |
 
 ## Union Find
 ## Trie
 ## Linked List
-## String
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
-| [Leetcode-1249. Minimum Remove To Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/) | [c++](./leetcode/1249.minimum-remove-to-make-valid-parentheses.cpp), [python](./leetcode/1249.minimum-remove-to-make-valid-parentheses.py) | O\(N\) | O\(N\) | \- | - |
-| [Lintcode-1790. Rotate String II](https://www.lintcode.com/problem/rotate-string-ii) | [c++](./lintcode/1790.rotate-string-ii.cpp), [python](./lintcode/1790.rotate-string-ii.py) | O\(N\) | O\(N\) | Simulation | - |
+| [Lintcode-1534. Convert Binary Search Tree To Sorted Doubly Linked List](https://www.lintcode.com/problem/convert-binary-search-tree-to-sorted-doubly-linked-list) | [c++](./lintcode/1534.convert-binary-search-tree-to-sorted-doubly-linked-list.cpp), [python](./lintcode/1534.convert-binary-search-tree-to-sorted-doubly-linked-list.py) | O\(N\) | O\(Height\) | BST \| Leetcode\-426 | - |
+| [Leetcode-114. Flatten Binary Tree To Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/) | [c++](./leetcode/114.flatten-binary-tree-to-linked-list.cpp), [python](./leetcode/114.flatten-binary-tree-to-linked-list.py) | O\(N\) | O\(Height\) | PreOrder | - |
 
-## Array
+## Other
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
+| [Leetcode-263. Ugly Number](https://leetcode.com/problems/ugly-number/description/) | [c++](./leetcode/263.ugly-number.cpp), [python](./leetcode/263.ugly-number.py) | O\(k\) | O\(1\) | \- | - |
+| [Leetcode-1249. Minimum Remove To Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/) | [c++](./leetcode/1249.minimum-remove-to-make-valid-parentheses.cpp), [python](./leetcode/1249.minimum-remove-to-make-valid-parentheses.py) | O\(N\) | O\(N\) | \- | - |
 | [Leetcode-2210. Count Hills And Valleys In An Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/description/) | [c++](./leetcode/2210.count-hills-and-valleys-in-an-array.cpp), [python](./leetcode/2210.count-hills-and-valleys-in-an-array.py) | O\(N\) | O\(1\) | \- | - |
+| [Lintcode-1790. Rotate String II](https://www.lintcode.com/problem/rotate-string-ii) | [c++](./lintcode/1790.rotate-string-ii.cpp), [python](./lintcode/1790.rotate-string-ii.py) | O\(N\) | O\(N\) | Simulation | - |
 
-## Other
+## Unknown
 | Problem | Solution | Time | Space | Note | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-1. Two Sum](https://leetcode.com/problems/two-sum/description/) | [c++](./leetcode/1.two-sum.cpp), [python](./leetcode/1.two-sum.py) | \- | \- | \- | - |
@@ -295,7 +311,6 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [Leetcode-253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/description/) | [c++](./leetcode/253.meeting-rooms-ii.cpp), [python](./leetcode/253.meeting-rooms-ii.py) | \- | \- | \- | - |
 | [Leetcode-256. Paint House](https://leetcode.com/problems/paint-house/description/) | [c++](./leetcode/256.paint-house.cpp), [python](./leetcode/256.paint-house.py) | \- | \- | \- | - |
 | [Leetcode-261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/description/) | [c++](./leetcode/261.graph-valid-tree.cpp), [python](./leetcode/261.graph-valid-tree.py) | \- | \- | \- | - |
-| [Leetcode-263. Ugly Number](https://leetcode.com/problems/ugly-number/description/) | [c++](./leetcode/263.ugly-number.cpp), [python](./leetcode/263.ugly-number.py) | O\(k\) | O\(1\) | \- | - |
 | [Leetcode-265. Paint House II](https://leetcode.com/problems/paint-house-ii/description/) | [c++](./leetcode/265.paint-house-ii.cpp), [python](./leetcode/265.paint-house-ii.py) | \- | \- | \- | - |
 | [Leetcode-269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/description/) | [python](./leetcode/269.alien-dictionary.py) | \- | \- | \- | - |
 | [Leetcode-270. Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/description/) | [c++](./leetcode/270.closest-binary-search-tree-value.cpp), [python](./leetcode/270.closest-binary-search-tree-value.py) | \- | \- | \- | - |
@@ -438,5 +453,5 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 Total sovled: **320**<br/>
 PS: semicolon(;) after each note means related questions are checked<br/>
 <br/>
-Auto updated at: **2024-06-25 15:37:57**<br/>
+Auto updated at: **2024-06-25 16:53:20**<br/>
 

leetcode/102.binary-tree-level-order-traversal.cpp

@@ -1,4 +1,4 @@
-//  Category: Tree, Breadth-First Search, Binary Tree
+//  Tag: Tree, Breadth-First Search, Binary Tree
 //  Time: O(N)
 //  Space: O(Width)
 //  Ref: -

leetcode/102.binary-tree-level-order-traversal.py

@@ -1,4 +1,4 @@
-#  Category: Tree, Breadth-First Search, Binary Tree
+#  Tag: Tree, Breadth-First Search, Binary Tree
 #  Time: O(N)
 #  Space: O(Width)
 #  Ref: -

leetcode/104.maximum-depth-of-binary-tree.cpp

@@ -1,4 +1,4 @@
-//  Category: Tree, Depth-First Search, Breadth-First Search, Binary Tree
+//  Tag: Tree, Depth-First Search, Breadth-First Search, Binary Tree
 //  Time: O(N)
 //  Space: O(Height)
 //  Ref: -

leetcode/104.maximum-depth-of-binary-tree.py

@@ -1,4 +1,4 @@
-#  Category: Tree, Depth-First Search, Breadth-First Search, Binary Tree
+#  Tag: Tree, Depth-First Search, Breadth-First Search, Binary Tree
 #  Time: O(N)
 #  Space: O(Height)
 #  Ref: -

leetcode/110.balanced-binary-tree.cpp

@@ -1,4 +1,4 @@
-//  Category: Tree, Depth-First Search, Binary Tree
+//  Tag: Tree, Depth-First Search, Binary Tree
 //  Time: O(N)
 //  Space: O(Height)
 //  Ref: -

leetcode/110.balanced-binary-tree.py

@@ -1,4 +1,4 @@
-#  Category: Tree, Depth-First Search, Binary Tree
+#  Tag: Tree, Depth-First Search, Binary Tree
 #  Time: O(N)
 #  Space: O(Height)
 #  Ref: -

leetcode/114.flatten-binary-tree-to-linked-list.cpp

@@ -1,4 +1,4 @@
-//  Category: Stack, Tree, Depth-First Search, Linked List, Binary Tree
+//  Tag: Stack, Tree, Depth-First Search, Linked List, Binary Tree
 //  Time: O(N)
 //  Space: O(Height)
 //  Ref: -

leetcode/114.flatten-binary-tree-to-linked-list.py

@@ -1,4 +1,4 @@
-#  Category: Stack, Tree, Depth-First Search, Linked List, Binary Tree
+#  Tag: Stack, Tree, Depth-First Search, Linked List, Binary Tree
 #  Time: O(N)
 #  Space: O(Height)
 #  Ref: -

leetcode/120.triangle.cpp

@@ -1,4 +1,4 @@
-//  Category: Array, Dynamic Programming
+//  Tag: Array, Dynamic Programming
 //  Time: O(N^2)
 //  Space: O(N)
 //  Ref: -

leetcode/120.triangle.py

@@ -1,4 +1,4 @@
-#  Category: Array, Dynamic Programming
+#  Tag: Array, Dynamic Programming
 #  Time: O(N^2)
 #  Space: O(N)
 #  Ref: -

leetcode/1249.minimum-remove-to-make-valid-parentheses.cpp

@@ -1,4 +1,4 @@
-//  Category: Stack, String
+//  Tag: Stack, String
 //  Time: O(N)
 //  Space: O(N)
 //  Ref: -

leetcode/1249.minimum-remove-to-make-valid-parentheses.py

@@ -1,4 +1,4 @@
-#  Category: Stack, String
+#  Tag: Stack, String
 #  Time: O(N)
 #  Space: O(N)
 #  Ref: -

leetcode/144.binary-tree-preorder-traversal.cpp

@@ -1,4 +1,4 @@
-//  Category: Stack, Tree, Depth-First Search, Binary Tree
+//  Tag: Stack, Tree, Depth-First Search, Binary Tree
 //  Time: O(N)
 //  Space: O(Height)
 //  Ref: -

leetcode/144.binary-tree-preorder-traversal.py

@@ -1,4 +1,4 @@
-#  Category: Stack, Tree, Depth-First Search, Binary Tree
+#  Tag: Stack, Tree, Depth-First Search, Binary Tree
 #  Time: O(N)
 #  Space: O(Height)
 #  Ref: -

leetcode/145.binary-tree-postorder-traversal.cpp

@@ -1,4 +1,4 @@
-//  Category: Stack, Tree, Depth-First Search, Binary Tree
+//  Tag: Stack, Tree, Depth-First Search, Binary Tree
 //  Time: O(N)
 //  Space: O(Height)
 //  Ref: -

leetcode/145.binary-tree-postorder-traversal.py

@@ -1,4 +1,4 @@
-#  Category: Stack, Tree, Depth-First Search, Binary Tree
+#  Tag: Stack, Tree, Depth-First Search, Binary Tree
 #  Time: O(N)
 #  Space: O(Height)
 #  Ref: -

leetcode/153.find-minimum-in-rotated-sorted-array.cpp

@@ -1,4 +1,4 @@
-//  Category: Array, Binary Search
+//  Tag: Array, Binary Search
 //  Time: O(logN)
 //  Space: O(1)
 //  Ref: https://youtu.be/GsecRZC5to4

leetcode/153.find-minimum-in-rotated-sorted-array.py

@@ -1,4 +1,4 @@
-#  Category: Array, Binary Search
+#  Tag: Array, Binary Search
 #  Time: O(logN)
 #  Space: O(1)
 #  Ref: https://youtu.be/GsecRZC5to4

leetcode/154.find-minimum-in-rotated-sorted-array-ii.cpp

@@ -1,4 +1,4 @@
-//  Category: Array, Binary Search
+//  Tag: Array, Binary Search
 //  Time: O(logN) ~ O(N)
 //  Space: O(1)
 //  Ref: -

leetcode/154.find-minimum-in-rotated-sorted-array-ii.py

@@ -1,4 +1,4 @@
-#  Category: Array, Binary Search
+#  Tag: Array, Binary Search
 #  Time: O(logN) ~ O(N)
 #  Space: O(1)
 #  Ref: -

leetcode/162.find-peak-element.cpp

@@ -1,4 +1,4 @@
-//  Category: Array, Binary Search
+//  Tag: Array, Binary Search
 //  Time: O(logN)
 //  Space: O(1)
 //  Ref: https://youtu.be/bexO0N9eP1I

leetcode/162.find-peak-element.py

@@ -1,4 +1,4 @@
-#  Category: Array, Binary Search
+#  Tag: Array, Binary Search
 #  Time: O(logN)
 #  Space: O(1)
 #  Ref: https://youtu.be/bexO0N9eP1I

leetcode/173.binary-search-tree-iterator.cpp

@@ -1,4 +1,4 @@
-//  Category: Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator
+//  Tag: Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator
 //  Time: O(1)
 //  Space: O(Height)
 //  Ref: -

leetcode/173.binary-search-tree-iterator.py

@@ -1,4 +1,4 @@
-#  Category: Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator
+#  Tag: Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator
 #  Time: O(1)
 #  Space: O(Height)
 #  Ref: -

leetcode/1901.find-a-peak-element-ii.cpp

@@ -1,4 +1,4 @@
-//  Category: Array, Binary Search, Matrix
+//  Tag: Array, Binary Search, Matrix
 //  Time: O(N * logM)
 //  Space: O(1)
 //  Ref: -

leetcode/1901.find-a-peak-element-ii.py

@@ -1,4 +1,4 @@
-#  Category: Array, Binary Search, Matrix
+#  Tag: Array, Binary Search, Matrix
 #  Time: O(N * logM)
 #  Space: O(1)
 #  Ref: -

leetcode/2210.count-hills-and-valleys-in-an-array.cpp

@@ -1,4 +1,4 @@
-//  Category: Array
+//  Tag: Array
 //  Time: O(N)
 //  Space: O(1)
 //  Ref: -

leetcode/2210.count-hills-and-valleys-in-an-array.py

@@ -1,4 +1,4 @@
-#  Category: Array
+#  Tag: Array
 #  Time: O(N)
 #  Space: O(1)
 #  Ref: -

leetcode/236.lowest-common-ancestor-of-a-binary-tree.cpp

@@ -1,4 +1,4 @@
-//  Category: Tree, Depth-First Search, Binary Tree
+//  Tag: Tree, Depth-First Search, Binary Tree
 //  Time: O(N)
 //  Space: O(Height)
 //  Ref: -

leetcode/236.lowest-common-ancestor-of-a-binary-tree.py

@@ -1,4 +1,4 @@
-#  Category: Tree, Depth-First Search, Binary Tree
+#  Tag: Tree, Depth-First Search, Binary Tree
 #  Time: O(N)
 #  Space: O(Height)
 #  Ref: -