From 568c414ae3ecc9d07c6182b9b528fc2b1d3bb033 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Sat, 27 Apr 2024 10:43:40 +0800 Subject: [PATCH] feat: update lc problems --- .../README.md | 2 +- .../README_EN.md | 2 +- .../0200-0299/0281.Zigzag Iterator/README.md | 48 ++++++++++++------- .../README.md | 2 +- .../README_EN.md | 2 +- .../0647.Palindromic Substrings/README.md | 2 +- .../0647.Palindromic Substrings/README_EN.md | 2 +- .../0924.Minimize Malware Spread/README.md | 2 +- .../0924.Minimize Malware Spread/README_EN.md | 2 +- .../0928.Minimize Malware Spread II/README.md | 2 +- .../README_EN.md | 2 +- .../1840.Maximum Building Height/README.md | 2 +- .../1840.Maximum Building Height/README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 12 ----- .../README_EN.md | 12 ----- solution/README.md | 14 +++--- solution/README_EN.md | 14 +++--- 19 files changed, 60 insertions(+), 68 deletions(-) diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README.md b/solution/0000-0099/0005.Longest Palindromic Substring/README.md index 8bdbee1937079..6b1fc1cece13f 100644 --- a/solution/0000-0099/0005.Longest Palindromic Substring/README.md +++ b/solution/0000-0099/0005.Longest Palindromic Substring/README.md @@ -2,7 +2,7 @@ [English Version](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md) - + ## 题目描述 diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md index 422e4444b15ab..83be89a06b1d5 100644 --- a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md +++ b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md @@ -2,7 +2,7 @@ [中文文档](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md) - + ## Description diff --git a/solution/0200-0299/0281.Zigzag Iterator/README.md b/solution/0200-0299/0281.Zigzag Iterator/README.md index 2ed80707dc355..498ecf6fe7074 100644 --- a/solution/0200-0299/0281.Zigzag Iterator/README.md +++ b/solution/0200-0299/0281.Zigzag Iterator/README.md @@ -8,30 +8,46 @@ -

给出两个一维的向量，请你实现一个迭代器，交替返回它们中间的元素。

+

给出两个整数向量 v1 和 v2，请你实现一个迭代器，交替返回它们中间的元素。

-

示例:

+

实现 ZigzagIterator 类：

-
输入:
-v1 = [1,2]
-v2 = [3,4,5,6] 
+
 
-输出: [1,3,2,4,5,6]
+
示例 1:

 
-解析: 通过连续调用 next 函数直到 hasNext 函数返回 false，
-     next 函数返回值的次序应依次为: [1,3,2,4,5,6]。
+
+输入：v1 = [1,2], v2 = [3,4,5,6]
+输出：[1,3,2,4,5,6]
+解释：通过重复调用 next 直到 hasNext 返回 false，那么 next 返回的元素的顺序应该是：[1,3,2,4,5,6]。
+
+ +

示例 2:

+ +
+输入：v1 = [1], v2 = []
+输出：[1]
+
+ +

示例 3:

-

拓展：假如给你 k 个一维向量呢？你的代码在这种情况下的扩展性又会如何呢?

+
+输入：v1 = [], v2 = [1]
+输出：[1]
+
-

拓展声明：
- “锯齿” 顺序对于 k > 2 的情况定义可能会有些歧义。所以，假如你觉得 “锯齿” 这个表述不妥，也可以认为这是一种 “循环”。例如：

+

拓展：假如给你 k 个向量呢？你的代码在这种情况下的扩展性又会如何呢?

-
输入:
-[1,2,3]
-[4,5,6,7]
-[8,9]
+
拓展声明：

+ “锯齿” 顺序对于 k > 2 的情况定义可能会有些歧义。所以，假如你觉得 “锯齿” 这个表述不妥，也可以认为这是一种 “循环”。例如：

 
-输出: [1,4,8,2,5,9,3,6,7].
+
+输入：v1 = [1,2,3], v2 = [4,5,6,7], v3 = [8,9]
+输出：[1,4,8,2,5,9,3,6,7]
 

 
 ## 解法
diff --git a/solution/0600-0699/0642.Design Search Autocomplete System/README.md b/solution/0600-0699/0642.Design Search Autocomplete System/README.md
index 495e73d07398f..330976a77d314 100644
--- a/solution/0600-0699/0642.Design Search Autocomplete System/README.md	
+++ b/solution/0600-0699/0642.Design Search Autocomplete System/README.md	
@@ -2,7 +2,7 @@
 
 [English Version](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md)
 
-
+
 
 ## 题目描述
 
diff --git a/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md b/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md
index 79c43a13554e1..59feb6e381815 100644
--- a/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md	
+++ b/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md	
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)
 
-
+
 
 ## Description
 
diff --git a/solution/0600-0699/0647.Palindromic Substrings/README.md b/solution/0600-0699/0647.Palindromic Substrings/README.md
index 11f5166f2eef9..86d137beb26e0 100644
--- a/solution/0600-0699/0647.Palindromic Substrings/README.md	
+++ b/solution/0600-0699/0647.Palindromic Substrings/README.md	
@@ -2,7 +2,7 @@
 
 [English Version](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md)
 
-
+
 
 ## 题目描述
 
diff --git a/solution/0600-0699/0647.Palindromic Substrings/README_EN.md b/solution/0600-0699/0647.Palindromic Substrings/README_EN.md
index bd2073b4c99be..bdc511060494a 100644
--- a/solution/0600-0699/0647.Palindromic Substrings/README_EN.md	
+++ b/solution/0600-0699/0647.Palindromic Substrings/README_EN.md	
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)
 
-
+
 
 ## Description
 
diff --git a/solution/0900-0999/0924.Minimize Malware Spread/README.md b/solution/0900-0999/0924.Minimize Malware Spread/README.md
index cc6aa79aeb349..e525c8357f4cc 100644
--- a/solution/0900-0999/0924.Minimize Malware Spread/README.md	
+++ b/solution/0900-0999/0924.Minimize Malware Spread/README.md	
@@ -2,7 +2,7 @@
 
 [English Version](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md)
 
-
+
 
 ## 题目描述
 
diff --git a/solution/0900-0999/0924.Minimize Malware Spread/README_EN.md b/solution/0900-0999/0924.Minimize Malware Spread/README_EN.md
index 414a8f02969fa..398519fa672f0 100644
--- a/solution/0900-0999/0924.Minimize Malware Spread/README_EN.md	
+++ b/solution/0900-0999/0924.Minimize Malware Spread/README_EN.md	
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)
 
-
+
 
 ## Description
 
diff --git a/solution/0900-0999/0928.Minimize Malware Spread II/README.md b/solution/0900-0999/0928.Minimize Malware Spread II/README.md
index ba07e1ab12274..2d8ae71e82dfe 100644
--- a/solution/0900-0999/0928.Minimize Malware Spread II/README.md	
+++ b/solution/0900-0999/0928.Minimize Malware Spread II/README.md	
@@ -2,7 +2,7 @@
 
 [English Version](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md)
 
-
+
 
 ## 题目描述
 
diff --git a/solution/0900-0999/0928.Minimize Malware Spread II/README_EN.md b/solution/0900-0999/0928.Minimize Malware Spread II/README_EN.md
index 5efa04eba2465..978b807d963d3 100644
--- a/solution/0900-0999/0928.Minimize Malware Spread II/README_EN.md	
+++ b/solution/0900-0999/0928.Minimize Malware Spread II/README_EN.md	
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md)
 
-
+
 
 ## Description
 
diff --git a/solution/1800-1899/1840.Maximum Building Height/README.md b/solution/1800-1899/1840.Maximum Building Height/README.md
index bb15e675b2e6f..d07093fd7e068 100644
--- a/solution/1800-1899/1840.Maximum Building Height/README.md	
+++ b/solution/1800-1899/1840.Maximum Building Height/README.md	
@@ -2,7 +2,7 @@
 
 [English Version](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md)
 
-
+
 
 ## 题目描述
 
diff --git a/solution/1800-1899/1840.Maximum Building Height/README_EN.md b/solution/1800-1899/1840.Maximum Building Height/README_EN.md
index c79070f61ba3f..cf97547a32969 100644
--- a/solution/1800-1899/1840.Maximum Building Height/README_EN.md	
+++ b/solution/1800-1899/1840.Maximum Building Height/README_EN.md	
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md)
 
-
+
 
 ## Description
 
diff --git a/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README.md b/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README.md
index 1c256caba542f..9f41cce27aeb1 100644
--- a/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README.md	
+++ b/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README.md	
@@ -2,7 +2,7 @@
 
 [English Version](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md)
 
-
+
 
 ## 题目描述
 
diff --git a/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README_EN.md b/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README_EN.md
index 404b764bbbc6d..cbf1081cb4ab6 100644
--- a/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README_EN.md	
+++ b/solution/2500-2599/2517.Maximum Tastiness of Candy Basket/README_EN.md	
@@ -2,7 +2,7 @@
 
 [中文文档](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md)
 
-
+
 
 ## Description
 
diff --git a/solution/2600-2699/2639.Find the Width of Columns of a Grid/README.md b/solution/2600-2699/2639.Find the Width of Columns of a Grid/README.md
index b8616fda88029..e870838cc719f 100644
--- a/solution/2600-2699/2639.Find the Width of Columns of a Grid/README.md	
+++ b/solution/2600-2699/2639.Find the Width of Columns of a Grid/README.md	
@@ -147,16 +147,4 @@ impl Solution {
 
 
 
-### 方法二
-
-
-
-```python
-class Solution:
-    def findColumnWidth(self, grid: List[List[int]]) -> List[int]:
-        return [max(len(str(x)) for x in col) for col in zip(*grid)]
-```
-
-
-
 
diff --git a/solution/2600-2699/2639.Find the Width of Columns of a Grid/README_EN.md b/solution/2600-2699/2639.Find the Width of Columns of a Grid/README_EN.md
index b17ca20d4518e..c1218b20dce5f 100644
--- a/solution/2600-2699/2639.Find the Width of Columns of a Grid/README_EN.md	
+++ b/solution/2600-2699/2639.Find the Width of Columns of a Grid/README_EN.md	
@@ -145,16 +145,4 @@ impl Solution {
 
 
 
-### Solution 2
-
-
-
-```python
-class Solution:
-    def findColumnWidth(self, grid: List[List[int]]) -> List[int]:
-        return [max(len(str(x)) for x in col) for col in zip(*grid)]
-```
-
-
-
 
diff --git a/solution/README.md b/solution/README.md
index 396fff7d2ae3e..536166db38e4f 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -15,7 +15,7 @@
 |  0002  |  [两数相加](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md)  |  `递归`,`链表`,`数学`  |  中等  |    |
 |  0003  |  [无重复字符的最长子串](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md)  |  `哈希表`,`字符串`,`滑动窗口`  |  中等  |    |
 |  0004  |  [寻找两个正序数组的中位数](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md)  |  `数组`,`二分查找`,`分治`  |  困难  |    |
-|  0005  |  [最长回文子串](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)  |  `字符串`,`动态规划`  |  中等  |    |
+|  0005  |  [最长回文子串](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)  |  `双指针`,`字符串`,`动态规划`  |  中等  |    |
 |  0006  |  [Z 字形变换](/solution/0000-0099/0006.Zigzag%20Conversion/README.md)  |  `字符串`  |  中等  |    |
 |  0007  |  [整数反转](/solution/0000-0099/0007.Reverse%20Integer/README.md)  |  `数学`  |  中等  |    |
 |  0008  |  [字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)  |  `字符串`  |  中等  |    |
@@ -652,12 +652,12 @@
 |  0639  |  [解码方法 II](/solution/0600-0699/0639.Decode%20Ways%20II/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
 |  0640  |  [求解方程](/solution/0600-0699/0640.Solve%20the%20Equation/README.md)  |  `数学`,`字符串`,`模拟`  |  中等  |    |
 |  0641  |  [设计循环双端队列](/solution/0600-0699/0641.Design%20Circular%20Deque/README.md)  |  `设计`,`队列`,`数组`,`链表`  |  中等  |    |
-|  0642  |  [设计搜索自动补全系统](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)  |  `设计`,`字典树`,`字符串`,`数据流`  |  困难  |  🔒  |
+|  0642  |  [设计搜索自动补全系统](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)  |  `设计`,`字典树`,`字符串`,`数据流`,`排序`,`堆（优先队列）`  |  困难  |  🔒  |
 |  0643  |  [子数组最大平均数 I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md)  |  `数组`,`滑动窗口`  |  简单  |    |
 |  0644  |  [子数组最大平均数 II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md)  |  `数组`,`二分查找`,`前缀和`  |  困难  |  🔒  |
 |  0645  |  [错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md)  |  `位运算`,`数组`,`哈希表`,`排序`  |  简单  |    |
 |  0646  |  [最长数对链](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md)  |  `贪心`,`数组`,`动态规划`,`排序`  |  中等  |    |
-|  0647  |  [回文子串](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)  |  `字符串`,`动态规划`  |  中等  |    |
+|  0647  |  [回文子串](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)  |  `双指针`,`字符串`,`动态规划`  |  中等  |    |
 |  0648  |  [单词替换](/solution/0600-0699/0648.Replace%20Words/README.md)  |  `字典树`,`数组`,`哈希表`,`字符串`  |  中等  |    |
 |  0649  |  [Dota2 参议院](/solution/0600-0699/0649.Dota2%20Senate/README.md)  |  `贪心`,`队列`,`字符串`  |  中等  |    |
 |  0650  |  [两个键的键盘](/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md)  |  `数学`,`动态规划`  |  中等  |    |
@@ -934,11 +934,11 @@
 |  0921  |  [使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md)  |  `栈`,`贪心`,`字符串`  |  中等  |  第 106 场周赛  |
 |  0922  |  [按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md)  |  `数组`,`双指针`,`排序`  |  简单  |  第 106 场周赛  |
 |  0923  |  [三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md)  |  `数组`,`哈希表`,`双指针`,`计数`,`排序`  |  中等  |  第 106 场周赛  |
-|  0924  |  [尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`哈希表`  |  困难  |  第 106 场周赛  |
+|  0924  |  [尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表`  |  困难  |  第 106 场周赛  |
 |  0925  |  [长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md)  |  `双指针`,`字符串`  |  简单  |  第 107 场周赛  |
 |  0926  |  [将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md)  |  `字符串`,`动态规划`  |  中等  |  第 107 场周赛  |
 |  0927  |  [三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md)  |  `数组`,`数学`  |  困难  |  第 107 场周赛  |
-|  0928  |  [尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`哈希表`  |  困难  |  第 107 场周赛  |
+|  0928  |  [尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表`  |  困难  |  第 107 场周赛  |
 |  0929  |  [独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md)  |  `数组`,`哈希表`,`字符串`  |  简单  |  第 108 场周赛  |
 |  0930  |  [和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md)  |  `数组`,`哈希表`,`前缀和`,`滑动窗口`  |  中等  |  第 108 场周赛  |
 |  0931  |  [下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md)  |  `数组`,`动态规划`,`矩阵`  |  中等  |  第 108 场周赛  |
@@ -1850,7 +1850,7 @@
 |  1837  |  [K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md)  |  `数学`  |  简单  |  第 238 场周赛  |
 |  1838  |  [最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md)  |  `贪心`,`数组`,`二分查找`,`前缀和`,`排序`,`滑动窗口`  |  中等  |  第 238 场周赛  |
 |  1839  |  [所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md)  |  `字符串`,`滑动窗口`  |  中等  |  第 238 场周赛  |
-|  1840  |  [最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md)  |  `数组`,`数学`  |  困难  |  第 238 场周赛  |
+|  1840  |  [最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md)  |  `数组`,`数学`,`排序`  |  困难  |  第 238 场周赛  |
 |  1841  |  [联赛信息统计](/solution/1800-1899/1841.League%20Statistics/README.md)  |  `数据库`  |  中等  |  🔒  |
 |  1842  |  [下个由相同数字构成的回文串](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md)  |  `双指针`,`字符串`  |  困难  |  🔒  |
 |  1843  |  [可疑银行账户](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md)  |  `数据库`  |  中等  |  🔒  |
@@ -2527,7 +2527,7 @@
 |  2514  |  [统计同位异构字符串数目](/solution/2500-2599/2514.Count%20Anagrams/README.md)  |  `哈希表`,`数学`,`字符串`,`组合数学`,`计数`  |  困难  |  第 94 场双周赛  |
 |  2515  |  [到目标字符串的最短距离](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README.md)  |  `数组`,`字符串`  |  简单  |  第 325 场周赛  |
 |  2516  |  [每种字符至少取 K 个](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README.md)  |  `哈希表`,`字符串`,`滑动窗口`  |  中等  |  第 325 场周赛  |
-|  2517  |  [礼盒的最大甜蜜度](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md)  |  `数组`,`二分查找`,`排序`  |  中等  |  第 325 场周赛  |
+|  2517  |  [礼盒的最大甜蜜度](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md)  |  `贪心`,`数组`,`二分查找`,`排序`  |  中等  |  第 325 场周赛  |
 |  2518  |  [好分区的数目](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README.md)  |  `数组`,`动态规划`  |  困难  |  第 325 场周赛  |
 |  2519  |  [统计 K-Big 索引的数量](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README.md)  |  `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序`  |  困难  |  🔒  |
 |  2520  |  [统计能整除数字的位数](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README.md)  |  `数学`  |  简单  |  第 326 场周赛  |
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 88cf7797eda14..5eb339824a3b5 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -13,7 +13,7 @@ Press Control + F(or Command + F on
 |  0002  |  [Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md)  |  `Recursion`,`Linked List`,`Math`  |  Medium  |    |
 |  0003  |  [Longest Substring Without Repeating Characters](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |    |
 |  0004  |  [Median of Two Sorted Arrays](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md)  |  `Array`,`Binary Search`,`Divide and Conquer`  |  Hard  |    |
-|  0005  |  [Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
+|  0005  |  [Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md)  |  `Two Pointers`,`String`,`Dynamic Programming`  |  Medium  |    |
 |  0006  |  [Zigzag Conversion](/solution/0000-0099/0006.Zigzag%20Conversion/README_EN.md)  |  `String`  |  Medium  |    |
 |  0007  |  [Reverse Integer](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md)  |  `Math`  |  Medium  |    |
 |  0008  |  [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md)  |  `String`  |  Medium  |    |
@@ -650,12 +650,12 @@ Press Control + F(or Command + F on
 |  0639  |  [Decode Ways II](/solution/0600-0699/0639.Decode%20Ways%20II/README_EN.md)  |  `String`,`Dynamic Programming`  |  Hard  |    |
 |  0640  |  [Solve the Equation](/solution/0600-0699/0640.Solve%20the%20Equation/README_EN.md)  |  `Math`,`String`,`Simulation`  |  Medium  |    |
 |  0641  |  [Design Circular Deque](/solution/0600-0699/0641.Design%20Circular%20Deque/README_EN.md)  |  `Design`,`Queue`,`Array`,`Linked List`  |  Medium  |    |
-|  0642  |  [Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md)  |  `Design`,`Trie`,`String`,`Data Stream`  |  Hard  |  🔒  |
+|  0642  |  [Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md)  |  `Design`,`Trie`,`String`,`Data Stream`,`Sorting`,`Heap (Priority Queue)`  |  Hard  |  🔒  |
 |  0643  |  [Maximum Average Subarray I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README_EN.md)  |  `Array`,`Sliding Window`  |  Easy  |    |
 |  0644  |  [Maximum Average Subarray II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README_EN.md)  |  `Array`,`Binary Search`,`Prefix Sum`  |  Hard  |  🔒  |
 |  0645  |  [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md)  |  `Bit Manipulation`,`Array`,`Hash Table`,`Sorting`  |  Easy  |    |
 |  0646  |  [Maximum Length of Pair Chain](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README_EN.md)  |  `Greedy`,`Array`,`Dynamic Programming`,`Sorting`  |  Medium  |    |
-|  0647  |  [Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |    |
+|  0647  |  [Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md)  |  `Two Pointers`,`String`,`Dynamic Programming`  |  Medium  |    |
 |  0648  |  [Replace Words](/solution/0600-0699/0648.Replace%20Words/README_EN.md)  |  `Trie`,`Array`,`Hash Table`,`String`  |  Medium  |    |
 |  0649  |  [Dota2 Senate](/solution/0600-0699/0649.Dota2%20Senate/README_EN.md)  |  `Greedy`,`Queue`,`String`  |  Medium  |    |
 |  0650  |  [2 Keys Keyboard](/solution/0600-0699/0650.2%20Keys%20Keyboard/README_EN.md)  |  `Math`,`Dynamic Programming`  |  Medium  |    |
@@ -932,11 +932,11 @@ Press Control + F(or Command + F on
 |  0921  |  [Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md)  |  `Stack`,`Greedy`,`String`  |  Medium  |  Weekly Contest 106  |
 |  0922  |  [Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md)  |  `Array`,`Two Pointers`,`Sorting`  |  Easy  |  Weekly Contest 106  |
 |  0923  |  [3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md)  |  `Array`,`Hash Table`,`Two Pointers`,`Counting`,`Sorting`  |  Medium  |  Weekly Contest 106  |
-|  0924  |  [Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Hash Table`  |  Hard  |  Weekly Contest 106  |
+|  0924  |  [Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table`  |  Hard  |  Weekly Contest 106  |
 |  0925  |  [Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md)  |  `Two Pointers`,`String`  |  Easy  |  Weekly Contest 107  |
 |  0926  |  [Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md)  |  `String`,`Dynamic Programming`  |  Medium  |  Weekly Contest 107  |
 |  0927  |  [Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md)  |  `Array`,`Math`  |  Hard  |  Weekly Contest 107  |
-|  0928  |  [Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Hash Table`  |  Hard  |  Weekly Contest 107  |
+|  0928  |  [Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md)  |  `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table`  |  Hard  |  Weekly Contest 107  |
 |  0929  |  [Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md)  |  `Array`,`Hash Table`,`String`  |  Easy  |  Weekly Contest 108  |
 |  0930  |  [Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md)  |  `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window`  |  Medium  |  Weekly Contest 108  |
 |  0931  |  [Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md)  |  `Array`,`Dynamic Programming`,`Matrix`  |  Medium  |  Weekly Contest 108  |
@@ -1848,7 +1848,7 @@ Press Control + F(or Command + F on
 |  1837  |  [Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md)  |  `Math`  |  Easy  |  Weekly Contest 238  |
 |  1838  |  [Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window`  |  Medium  |  Weekly Contest 238  |
 |  1839  |  [Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md)  |  `String`,`Sliding Window`  |  Medium  |  Weekly Contest 238  |
-|  1840  |  [Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md)  |  `Array`,`Math`  |  Hard  |  Weekly Contest 238  |
+|  1840  |  [Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md)  |  `Array`,`Math`,`Sorting`  |  Hard  |  Weekly Contest 238  |
 |  1841  |  [League Statistics](/solution/1800-1899/1841.League%20Statistics/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
 |  1842  |  [Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README_EN.md)  |  `Two Pointers`,`String`  |  Hard  |  🔒  |
 |  1843  |  [Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
@@ -2525,7 +2525,7 @@ Press Control + F(or Command + F on
 |  2514  |  [Count Anagrams](/solution/2500-2599/2514.Count%20Anagrams/README_EN.md)  |  `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting`  |  Hard  |  Biweekly Contest 94  |
 |  2515  |  [Shortest Distance to Target String in a Circular Array](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README_EN.md)  |  `Array`,`String`  |  Easy  |  Weekly Contest 325  |
 |  2516  |  [Take K of Each Character From Left and Right](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README_EN.md)  |  `Hash Table`,`String`,`Sliding Window`  |  Medium  |  Weekly Contest 325  |
-|  2517  |  [Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md)  |  `Array`,`Binary Search`,`Sorting`  |  Medium  |  Weekly Contest 325  |
+|  2517  |  [Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`,`Sorting`  |  Medium  |  Weekly Contest 325  |
 |  2518  |  [Number of Great Partitions](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |  Weekly Contest 325  |
 |  2519  |  [Count the Number of K-Big Indices](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README_EN.md)  |  `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort`  |  Hard  |  🔒  |
 |  2520  |  [Count the Digits That Divide a Number](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README_EN.md)  |  `Math`  |  Easy  |  Weekly Contest 326  |