feat: add new lc problems (#4668)

Author: yanglbme

solution/3600-3699/3613.Minimize Maximum Component Cost/README.md

@@ -5,10 +5,10 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3613.Mi
 rating: 1641
 source: 第 458 场周赛 Q2
 tags:
-    - 排序
     - 并查集
     - 图
     - 二分查找
+    - 排序
 ---
 
 <!-- problem:start -->

solution/3600-3699/3613.Minimize Maximum Component Cost/README_EN.md

@@ -5,10 +5,10 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3613.Mi
 rating: 1641
 source: Weekly Contest 458 Q2
 tags:
-    - Sort
     - Union Find
     - Graph
     - Binary Search
+    - Sorting
 ---
 
 <!-- problem:start -->

solution/3600-3699/3624.Number of Integers With Popcount-Depth Equal to K II/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3624.Nu
 rating: 2085
 source: 第 459 场周赛 Q3
 tags:
+    - 树状数组
     - 线段树
     - 数组
     - 分治

solution/3600-3699/3624.Number of Integers With Popcount-Depth Equal to K II/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3624.Nu
 rating: 2085
 source: Weekly Contest 459 Q3
 tags:
+    - Binary Indexed Tree
     - Segment Tree
     - Array
     - Divide and Conquer

solution/3600-3699/3628.Maximum Number of Subsequences After One Inserting/README.md

@@ -4,6 +4,11 @@ difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3628.Maximum%20Number%20of%20Subsequences%20After%20One%20Inserting/README.md
 rating: 1753
 source: 第 460 场周赛 Q2
+tags:
+    - 贪心
+    - 字符串
+    - 动态规划
+    - 前缀和
 ---
 
 <!-- problem:start -->

solution/3600-3699/3628.Maximum Number of Subsequences After One Inserting/README_EN.md

@@ -4,6 +4,11 @@ difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3628.Maximum%20Number%20of%20Subsequences%20After%20One%20Inserting/README_EN.md
 rating: 1753
 source: Weekly Contest 460 Q2
+tags:
+    - Greedy
+    - String
+    - Dynamic Programming
+    - Prefix Sum
 ---
 
 <!-- problem:start -->

solution/3600-3699/3629.Minimum Jumps to Reach End via Prime Teleportation/README.md

@@ -4,6 +4,12 @@ difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3629.Minimum%20Jumps%20to%20Reach%20End%20via%20Prime%20Teleportation/README.md
 rating: 2139
 source: 第 460 场周赛 Q3
+tags:
+    - 广度优先搜索
+    - 数组
+    - 哈希表
+    - 数学
+    - 数论
 ---
 
 <!-- problem:start -->

solution/3600-3699/3629.Minimum Jumps to Reach End via Prime Teleportation/README_EN.md

@@ -4,6 +4,12 @@ difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3629.Minimum%20Jumps%20to%20Reach%20End%20via%20Prime%20Teleportation/README_EN.md
 rating: 2139
 source: Weekly Contest 460 Q3
+tags:
+    - Breadth-First Search
+    - Array
+    - Hash Table
+    - Math
+    - Number Theory
 ---
 
 <!-- problem:start -->

solution/3600-3699/3630.Partition Array for Maximum XOR and AND/README.md

@@ -4,6 +4,11 @@ difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3630.Partition%20Array%20for%20Maximum%20XOR%20and%20AND/README.md
 rating: 2743
 source: 第 460 场周赛 Q4
+tags:
+    - 贪心
+    - 数组
+    - 数学
+    - 枚举
 ---
 
 <!-- problem:start -->

solution/3600-3699/3630.Partition Array for Maximum XOR and AND/README_EN.md

@@ -4,6 +4,11 @@ difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3630.Partition%20Array%20for%20Maximum%20XOR%20and%20AND/README_EN.md
 rating: 2743
 source: Weekly Contest 460 Q4
+tags:
+    - Greedy
+    - Array
+    - Math
+    - Enumeration
 ---
 
 <!-- problem:start -->