diff --git a/solution/2200-2299/2235.Add Two Integers/README.md b/solution/2200-2299/2235.Add Two Integers/README.md
new file mode 100644
index 0000000000000..4ff5ee091fc18
--- /dev/null
+++ b/solution/2200-2299/2235.Add Two Integers/README.md
@@ -0,0 +1,71 @@
+# [2235. 两整数相加](https://leetcode-cn.com/problems/add-two-integers)
+
+[English Version](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md)
+
+## 题目描述
+
+
+
+给你两个整数 num1 和 num2，返回这两个整数的和。
+
+
+示例 1：
+
+
+输入：num1 = 12, num2 = 5
+输出：17
+解释：num1 是 12，num2 是 5 ，它们的和是 12 + 5 = 17 ，因此返回 17 。
+
+
+示例 2：
+
+
+输入：num1 = -10, num2 = 4
+输出：-6
+解释：num1 + num2 = -6 ，因此返回 -6 。
+
+
+
+
+提示：
+
+
+ -100 <= num1, num2 <= 100
+
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2200-2299/2235.Add Two Integers/README_EN.md b/solution/2200-2299/2235.Add Two Integers/README_EN.md
new file mode 100644
index 0000000000000..dea4008045ee4
--- /dev/null
+++ b/solution/2200-2299/2235.Add Two Integers/README_EN.md
@@ -0,0 +1,61 @@
+# [2235. Add Two Integers](https://leetcode.com/problems/add-two-integers)
+
+[中文文档](/solution/2200-2299/2235.Add%20Two%20Integers/README.md)
+
+## Description
+
+Given two integers num1 and num2, return the sum of the two integers.
+
+Example 1:
+
+
+Input: num1 = 12, num2 = 5
+Output: 17
+Explanation: num1 is 12, num2 is 5, and their sum is 12 + 5 = 17, so 17 is returned.
+
+
+Example 2:
+
+
+Input: num1 = -10, num2 = 4
+Output: -6
+Explanation: num1 + num2 = -6, so -6 is returned.
+
+
+
+Constraints:
+
+
+ -100 <= num1, num2 <= 100
+
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README.md b/solution/2200-2299/2236.Root Equals Sum of Children/README.md
new file mode 100644
index 0000000000000..685370e05f664
--- /dev/null
+++ b/solution/2200-2299/2236.Root Equals Sum of Children/README.md
@@ -0,0 +1,77 @@
+# [2236. 判断根结点是否等于子结点之和](https://leetcode-cn.com/problems/root-equals-sum-of-children)
+
+[English Version](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个 二叉树 的根结点 root，该二叉树由恰好 3 个结点组成：根结点、左子结点和右子结点。
+
+如果根结点值等于两个子结点值之和，返回 true ，否则返回 false 。
+
+
+
+示例 1：
+
+
+输入：root = [10,4,6]
+输出：true
+解释：根结点、左子结点和右子结点的值分别是 10 、4 和 6 。
+由于 10 等于 4 + 6 ，因此返回 true 。
+
+
+示例 2：
+
+
+输入：root = [5,3,1]
+输出：false
+解释：根结点、左子结点和右子结点的值分别是 5 、3 和 1 。
+由于 5 不等于 3 + 1 ，因此返回 false 。
+
+
+
+
+提示：
+
+
+ - 树只包含根结点、左子结点和右子结点
+ -100 <= Node.val <= 100
+
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md
new file mode 100644
index 0000000000000..52ddbac0e752d
--- /dev/null
+++ b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md
@@ -0,0 +1,67 @@
+# [2236. Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children)
+
+[中文文档](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md)
+
+## Description
+
+You are given the root of a binary tree that consists of exactly 3 nodes: the root, its left child, and its right child.
+
+Return true if the value of the root is equal to the sum of the values of its two children, or false otherwise.
+
+
+Example 1:
+
+
+Input: root = [10,4,6]
+Output: true
+Explanation: The values of the root, its left child, and its right child are 10, 4, and 6, respectively.
+10 is equal to 4 + 6, so we return true.
+
+
+Example 2:
+
+
+Input: root = [5,3,1]
+Output: false
+Explanation: The values of the root, its left child, and its right child are 5, 3, and 1, respectively.
+5 is not equal to 3 + 1, so we return false.
+
+
+
+Constraints:
+
+
+ - The tree consists only of the root, its left child, and its right child.
+ -100 <= Node.val <= 100
+
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio-1.png b/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio-1.png
new file mode 100644
index 0000000000000..71b7df4f94dc2
Binary files /dev/null and b/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio-1.png differ
diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio.png b/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio.png
new file mode 100644
index 0000000000000..98846bac4f280
Binary files /dev/null and b/solution/2200-2299/2236.Root Equals Sum of Children/images/graph3drawio.png differ
diff --git a/solution/README.md b/solution/README.md
index 663a9f83845d4..5428690968c73 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -87,7 +87,7 @@
| [0074](https://leetcode-cn.com/problems/search-a-2d-matrix) | [搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | |
| [0075](https://leetcode-cn.com/problems/sort-colors) | [颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md) | `数组`,`双指针`,`排序` | 中等 | |
| [0076](https://leetcode-cn.com/problems/minimum-window-substring) | [最小覆盖子串](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | |
-| [0077](https://leetcode-cn.com/problems/combinations) | [组合](/solution/0000-0099/0077.Combinations/README.md) | `数组`,`回溯` | 中等 | |
+| [0077](https://leetcode-cn.com/problems/combinations) | [组合](/solution/0000-0099/0077.Combinations/README.md) | `回溯` | 中等 | |
| [0078](https://leetcode-cn.com/problems/subsets) | [子集](/solution/0000-0099/0078.Subsets/README.md) | `位运算`,`数组`,`回溯` | 中等 | |
| [0079](https://leetcode-cn.com/problems/word-search) | [单词搜索](/solution/0000-0099/0079.Word%20Search/README.md) | `数组`,`回溯`,`矩阵` | 中等 | |
| [0080](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii) | [删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md) | `数组`,`双指针` | 中等 | |
@@ -228,6 +228,7 @@
| [0215](https://leetcode-cn.com/problems/kth-largest-element-in-an-array) | [数组中的第K个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md) | `数组`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | |
| [0216](https://leetcode-cn.com/problems/combination-sum-iii) | [组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md) | `数组`,`回溯` | 中等 | |
| [0217](https://leetcode-cn.com/problems/contains-duplicate) | [存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md) | `数组`,`哈希表`,`排序` | 简单 | |
+| [0218](https://leetcode-cn.com/problems/the-skyline-problem) | [天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md) | `树状数组`,`线段树`,`数组`,`分治`,`有序集合`,`扫描线`,`堆（优先队列）` | 困难 | |
| [0219](https://leetcode-cn.com/problems/contains-duplicate-ii) | [存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md) | `数组`,`哈希表`,`滑动窗口` | 简单 | |
| [0220](https://leetcode-cn.com/problems/contains-duplicate-iii) | [存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md) | `数组`,`桶排序`,`有序集合`,`排序`,`滑动窗口` | 中等 | |
| [0221](https://leetcode-cn.com/problems/maximal-square) | [最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | |
@@ -591,6 +592,7 @@
| [0579](https://leetcode-cn.com/problems/find-cumulative-salary-of-an-employee) | [查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md) | `数据库` | 困难 | 🔒 |
| [0580](https://leetcode-cn.com/problems/count-student-number-in-departments) | [统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md) | `数据库` | 中等 | 🔒 |
| [0581](https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray) | [最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md) | `栈`,`贪心`,`数组`,`双指针`,`排序`,`单调栈` | 中等 | |
+| [0582](https://leetcode-cn.com/problems/kill-process) | [杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 中等 | 🔒 |
| [0583](https://leetcode-cn.com/problems/delete-operation-for-two-strings) | [两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md) | `字符串`,`动态规划` | 中等 | |
| [0584](https://leetcode-cn.com/problems/find-customer-referee) | [寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md) | `数据库` | 简单 | |
| [0585](https://leetcode-cn.com/problems/investments-in-2016) | [2016年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md) | `数据库` | 中等 | 🔒 |
@@ -686,6 +688,7 @@
| [0675](https://leetcode-cn.com/problems/cut-off-trees-for-golf-event) | [为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | |
| [0676](https://leetcode-cn.com/problems/implement-magic-dictionary) | [实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | |
| [0677](https://leetcode-cn.com/problems/map-sum-pairs) | [键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | |
+| [0678](https://leetcode-cn.com/problems/valid-parenthesis-string) | [有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md) | `栈`,`贪心`,`字符串`,`动态规划` | 中等 | |
| [0679](https://leetcode-cn.com/problems/24-game) | [24 点游戏](/solution/0600-0699/0679.24%20Game/README.md) | `数组`,`数学`,`回溯` | 困难 | |
| [0680](https://leetcode-cn.com/problems/valid-palindrome-ii) | [验证回文字符串 Ⅱ](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md) | `贪心`,`双指针`,`字符串` | 简单 | |
| [0681](https://leetcode-cn.com/problems/next-closest-time) | [最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md) | `字符串`,`枚举` | 中等 | 🔒 |
@@ -920,7 +923,6 @@
| [0910](https://leetcode-cn.com/problems/smallest-range-ii) | [最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | |
| [0911](https://leetcode-cn.com/problems/online-election) | [在线选举](/solution/0900-0999/0911.Online%20Election/README.md) | `设计`,`数组`,`哈希表`,`二分查找` | 中等 | |
| [0912](https://leetcode-cn.com/problems/sort-an-array) | [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) | `数组`,`分治`,`桶排序`,`计数排序`,`基数排序`,`排序`,`堆（优先队列）`,`归并排序` | 中等 | |
-| [0913](https://leetcode-cn.com/problems/cat-and-mouse) | [猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) | `广度优先搜索`,`图`,`记忆化搜索`,`数学`,`动态规划`,`博弈` | 困难 | |
| [0914](https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards) | [卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 简单 | |
| [0915](https://leetcode-cn.com/problems/partition-array-into-disjoint-intervals) | [分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) | `数组` | 中等 | |
| [0916](https://leetcode-cn.com/problems/word-subsets) | [单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) | `数组`,`哈希表`,`字符串` | 中等 | |
@@ -996,7 +998,6 @@
| [0986](https://leetcode-cn.com/problems/interval-list-intersections) | [区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) | `数组`,`双指针` | 中等 | |
| [0987](https://leetcode-cn.com/problems/vertical-order-traversal-of-a-binary-tree) | [二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 困难 | |
| [0988](https://leetcode-cn.com/problems/smallest-string-starting-from-leaf) | [从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | |
-| [0989](https://leetcode-cn.com/problems/add-to-array-form-of-integer) | [数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) | `数组`,`数学` | 简单 | |
| [0990](https://leetcode-cn.com/problems/satisfiability-of-equality-equations) | [等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) | `并查集`,`图`,`数组`,`字符串` | 中等 | |
| [0991](https://leetcode-cn.com/problems/broken-calculator) | [坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) | `贪心`,`数学` | 中等 | |
| [0992](https://leetcode-cn.com/problems/subarrays-with-k-different-integers) | [K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) | `数组`,`哈希表`,`计数`,`滑动窗口` | 困难 | |
@@ -1386,6 +1387,7 @@
| [1376](https://leetcode-cn.com/problems/time-needed-to-inform-all-employees) | [通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) | `树`,`深度优先搜索`,`广度优先搜索` | 中等 | |
| [1377](https://leetcode-cn.com/problems/frog-position-after-t-seconds) | [T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图` | 困难 | |
| [1378](https://leetcode-cn.com/problems/replace-employee-id-with-the-unique-identifier) | [使用唯一标识码替换员工ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md) | `数据库` | 简单 | 🔒 |
+| [1379](https://leetcode-cn.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree) | [找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | |
| [1380](https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix) | [矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) | `数组`,`矩阵` | 简单 | |
| [1381](https://leetcode-cn.com/problems/design-a-stack-with-increment-operation) | [设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) | `栈`,`设计`,`数组` | 中等 | |
| [1382](https://leetcode-cn.com/problems/balance-a-binary-search-tree) | [将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) | `贪心`,`树`,`深度优先搜索`,`二叉搜索树`,`分治`,`二叉树` | 中等 | |
@@ -1407,6 +1409,7 @@
| [1398](https://leetcode-cn.com/problems/customers-who-bought-products-a-and-b-but-not-c) | [购买了产品 A 和产品 B 却没有购买产品 C 的顾客](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md) | `数据库` | 中等 | 🔒 |
| [1399](https://leetcode-cn.com/problems/count-largest-group) | [统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) | `哈希表`,`数学` | 简单 | |
| [1400](https://leetcode-cn.com/problems/construct-k-palindrome-strings) | [构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) | `贪心`,`哈希表`,`字符串`,`计数` | 中等 | |
+| [1401](https://leetcode-cn.com/problems/circle-and-rectangle-overlapping) | [圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) | `几何`,`数学` | 中等 | |
| [1402](https://leetcode-cn.com/problems/reducing-dishes) | [做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 困难 | |
| [1403](https://leetcode-cn.com/problems/minimum-subsequence-in-non-increasing-order) | [非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) | `贪心`,`数组`,`排序` | 简单 | |
| [1404](https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one) | [将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) | `位运算`,`字符串` | 中等 | |
@@ -1703,6 +1706,7 @@
| [1695](https://leetcode-cn.com/problems/maximum-erasure-value) | [删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | |
| [1696](https://leetcode-cn.com/problems/jump-game-vi) | [跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) | `队列`,`数组`,`动态规划`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 中等 | |
| [1697](https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths) | [检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) | `并查集`,`图`,`数组`,`排序` | 困难 | |
+| [1698](https://leetcode-cn.com/problems/number-of-distinct-substrings-in-a-string) | [字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) | `字典树`,`字符串`,`后缀数组`,`哈希函数`,`滚动哈希` | 中等 | 🔒 |
| [1699](https://leetcode-cn.com/problems/number-of-calls-between-two-persons) | [两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md) | `数据库` | 中等 | 🔒 |
| [1700](https://leetcode-cn.com/problems/number-of-students-unable-to-eat-lunch) | [无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) | `栈`,`队列`,`数组`,`模拟` | 简单 | |
| [1701](https://leetcode-cn.com/problems/average-waiting-time) | [平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) | `数组`,`模拟` | 中等 | |
@@ -1739,11 +1743,14 @@
| [1732](https://leetcode-cn.com/problems/find-the-highest-altitude) | [找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) | `数组`,`前缀和` | 简单 | |
| [1733](https://leetcode-cn.com/problems/minimum-number-of-people-to-teach) | [需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) | `贪心`,`数组` | 中等 | |
| [1734](https://leetcode-cn.com/problems/decode-xored-permutation) | [解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) | `位运算`,`数组` | 中等 | |
+| [1735](https://leetcode-cn.com/problems/count-ways-to-make-array-with-product) | [生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) | `数组`,`数学`,`动态规划` | 困难 | |
+| [1736](https://leetcode-cn.com/problems/latest-time-by-replacing-hidden-digits) | [替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) | `字符串` | 简单 | |
| [1737](https://leetcode-cn.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions) | [满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) | `哈希表`,`字符串`,`计数`,`前缀和` | 中等 | |
| [1738](https://leetcode-cn.com/problems/find-kth-largest-xor-coordinate-value) | [找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) | `位运算`,`数组`,`分治`,`矩阵`,`前缀和`,`快速选择`,`堆（优先队列）` | 中等 | |
| [1739](https://leetcode-cn.com/problems/building-boxes) | [放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) | `贪心`,`数学`,`二分查找` | 困难 | |
| [1740](https://leetcode-cn.com/problems/find-distance-in-a-binary-tree) | [找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 |
| [1741](https://leetcode-cn.com/problems/find-total-time-spent-by-each-employee) | [查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md) | `数据库` | 简单 | |
+| [1742](https://leetcode-cn.com/problems/maximum-number-of-balls-in-a-box) | [盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) | `哈希表`,`数学`,`计数` | 简单 | |
| [1743](https://leetcode-cn.com/problems/restore-the-array-from-adjacent-pairs) | [从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) | `数组`,`哈希表` | 中等 | |
| [1744](https://leetcode-cn.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day) | [你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) | `数组`,`前缀和` | 中等 | |
| [1745](https://leetcode-cn.com/problems/palindrome-partitioning-iv) | [回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) | `字符串`,`动态规划` | 困难 | |
@@ -1752,6 +1759,7 @@
| [1748](https://leetcode-cn.com/problems/sum-of-unique-elements) | [唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) | `数组`,`哈希表`,`计数` | 简单 | |
| [1749](https://leetcode-cn.com/problems/maximum-absolute-sum-of-any-subarray) | [任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) | `数组`,`动态规划` | 中等 | |
| [1750](https://leetcode-cn.com/problems/minimum-length-of-string-after-deleting-similar-ends) | [删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) | `双指针`,`字符串` | 中等 | |
+| [1751](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended-ii) | [最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) | `数组`,`二分查找`,`动态规划` | 困难 | |
| [1752](https://leetcode-cn.com/problems/check-if-array-is-sorted-and-rotated) | [检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) | `数组` | 简单 | |
| [1753](https://leetcode-cn.com/problems/maximum-score-from-removing-stones) | [移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) | `贪心`,`数学`,`堆（优先队列）` | 中等 | |
| [1754](https://leetcode-cn.com/problems/largest-merge-of-two-strings) | [构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) | `贪心`,`双指针`,`字符串` | 中等 | |
@@ -2127,6 +2135,7 @@
| [2124](https://leetcode-cn.com/problems/check-if-all-as-appears-before-all-bs) | [检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) | `字符串` | 简单 | |
| [2125](https://leetcode-cn.com/problems/number-of-laser-beams-in-a-bank) | [银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) | `数组`,`数学`,`字符串`,`矩阵` | 中等 | |
| [2126](https://leetcode-cn.com/problems/destroying-asteroids) | [摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) | `贪心`,`数组`,`排序` | 中等 | |
+| [2127](https://leetcode-cn.com/problems/maximum-employees-to-be-invited-to-a-meeting) | [参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) | `深度优先搜索`,`图`,`拓扑排序` | 困难 | |
| [2128](https://leetcode-cn.com/problems/remove-all-ones-with-row-and-column-flips) | [通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md) | `位运算`,`数组`,`数学`,`矩阵` | 中等 | 🔒 |
| [2129](https://leetcode-cn.com/problems/capitalize-the-title) | [将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) | `字符串` | 简单 | |
| [2130](https://leetcode-cn.com/problems/maximum-twin-sum-of-a-linked-list) | [链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) | `栈`,`链表`,`双指针` | 中等 | |
@@ -2229,11 +2238,13 @@
| [2227](https://leetcode-cn.com/problems/encrypt-and-decrypt-strings) | [加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) | `设计`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | |
| [2228](https://leetcode-cn.com/problems/users-with-two-purchases-within-seven-days) | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md) | `数据库` | 中等 | 🔒 |
| [2229](https://leetcode-cn.com/problems/check-if-an-array-is-consecutive) | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md) | `数组` | 简单 | 🔒 |
-| [2230](https://leetcode-cn.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | | 简单 | 🔒 |
-| [2231](https://leetcode-cn.com/problems/largest-number-after-digit-swaps-by-parity) | [按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) | | 简单 | |
-| [2232](https://leetcode-cn.com/problems/minimize-result-by-adding-parentheses-to-expression) | [向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) | | 中等 | |
-| [2233](https://leetcode-cn.com/problems/maximum-product-after-k-increments) | [K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) | | 中等 | |
-| [2234](https://leetcode-cn.com/problems/maximum-total-beauty-of-the-gardens) | [花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) | | 困难 | |
+| [2230](https://leetcode-cn.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | `数据库` | 简单 | 🔒 |
+| [2231](https://leetcode-cn.com/problems/largest-number-after-digit-swaps-by-parity) | [按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) | `排序`,`堆（优先队列）` | 简单 | |
+| [2232](https://leetcode-cn.com/problems/minimize-result-by-adding-parentheses-to-expression) | [向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) | `字符串`,`枚举` | 中等 | |
+| [2233](https://leetcode-cn.com/problems/maximum-product-after-k-increments) | [K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | |
+| [2234](https://leetcode-cn.com/problems/maximum-total-beauty-of-the-gardens) | [花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 困难 | |
+| [2235](https://leetcode-cn.com/problems/add-two-integers) | [两整数相加](/solution/2200-2299/2235.Add%20Two%20Integers/README.md) | `数学` | 简单 | |
+| [2236](https://leetcode-cn.com/problems/root-equals-sum-of-children) | [判断根结点是否等于子结点之和](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md) | `树`,`二叉树` | 简单 | |
## 版权
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 6c2664c7accd9..0ea148c7a9a72 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -85,7 +85,7 @@ Press Control+F(or Command+F on the
| [0074](https://leetcode.com/problems/search-a-2d-matrix) | [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | |
| [0075](https://leetcode.com/problems/sort-colors) | [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | |
| [0076](https://leetcode.com/problems/minimum-window-substring) | [Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | |
-| [0077](https://leetcode.com/problems/combinations) | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Array`,`Backtracking` | Medium | |
+| [0077](https://leetcode.com/problems/combinations) | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Backtracking` | Medium | |
| [0078](https://leetcode.com/problems/subsets) | [Subsets](/solution/0000-0099/0078.Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | |
| [0079](https://leetcode.com/problems/word-search) | [Word Search](/solution/0000-0099/0079.Word%20Search/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | |
| [0080](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | |
@@ -226,6 +226,7 @@ Press Control+F(or Command+F on the
| [0215](https://leetcode.com/problems/kth-largest-element-in-an-array) | [Kth Largest Element in an Array](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | |
| [0216](https://leetcode.com/problems/combination-sum-iii) | [Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md) | `Array`,`Backtracking` | Medium | |
| [0217](https://leetcode.com/problems/contains-duplicate) | [Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | |
+| [0218](https://leetcode.com/problems/the-skyline-problem) | [The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Divide and Conquer`,`Ordered Set`,`Line Sweep`,`Heap (Priority Queue)` | Hard | |
| [0219](https://leetcode.com/problems/contains-duplicate-ii) | [Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Easy | |
| [0220](https://leetcode.com/problems/contains-duplicate-iii) | [Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README_EN.md) | `Array`,`Bucket Sort`,`Ordered Set`,`Sorting`,`Sliding Window` | Medium | |
| [0221](https://leetcode.com/problems/maximal-square) | [Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | |
@@ -589,6 +590,7 @@ Press Control+F(or Command+F on the
| [0579](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) | [Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md) | `Database` | Hard | 🔒 |
| [0580](https://leetcode.com/problems/count-student-number-in-departments) | [Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md) | `Database` | Medium | 🔒 |
| [0581](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [Shortest Unsorted Continuous Subarray](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Sorting`,`Monotonic Stack` | Medium | |
+| [0582](https://leetcode.com/problems/kill-process) | [Kill Process](/solution/0500-0599/0582.Kill%20Process/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | 🔒 |
| [0583](https://leetcode.com/problems/delete-operation-for-two-strings) | [Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | |
| [0584](https://leetcode.com/problems/find-customer-referee) | [Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README_EN.md) | `Database` | Easy | |
| [0585](https://leetcode.com/problems/investments-in-2016) | [Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README_EN.md) | `Database` | Medium | 🔒 |
@@ -684,6 +686,7 @@ Press Control+F(or Command+F on the
| [0675](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [Cut Off Trees for Golf Event](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | |
| [0676](https://leetcode.com/problems/implement-magic-dictionary) | [Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | |
| [0677](https://leetcode.com/problems/map-sum-pairs) | [Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | |
+| [0678](https://leetcode.com/problems/valid-parenthesis-string) | [Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | |
| [0679](https://leetcode.com/problems/24-game) | [24 Game](/solution/0600-0699/0679.24%20Game/README_EN.md) | `Array`,`Math`,`Backtracking` | Hard | |
| [0680](https://leetcode.com/problems/valid-palindrome-ii) | [Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | |
| [0681](https://leetcode.com/problems/next-closest-time) | [Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md) | `String`,`Enumeration` | Medium | 🔒 |
@@ -918,7 +921,6 @@ Press Control+F(or Command+F on the
| [0910](https://leetcode.com/problems/smallest-range-ii) | [Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | |
| [0911](https://leetcode.com/problems/online-election) | [Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | |
| [0912](https://leetcode.com/problems/sort-an-array) | [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Bucket Sort`,`Counting Sort`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)`,`Merge Sort` | Medium | |
-| [0913](https://leetcode.com/problems/cat-and-mouse) | [Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) | `Breadth-First Search`,`Graph`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | |
| [0914](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | [X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | |
| [0915](https://leetcode.com/problems/partition-array-into-disjoint-intervals) | [Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) | `Array` | Medium | |
| [0916](https://leetcode.com/problems/word-subsets) | [Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | |
@@ -994,7 +996,6 @@ Press Control+F(or Command+F on the
| [0986](https://leetcode.com/problems/interval-list-intersections) | [Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) | `Array`,`Two Pointers` | Medium | |
| [0987](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree) | [Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Hard | |
| [0988](https://leetcode.com/problems/smallest-string-starting-from-leaf) | [Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | |
-| [0989](https://leetcode.com/problems/add-to-array-form-of-integer) | [Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) | `Array`,`Math` | Easy | |
| [0990](https://leetcode.com/problems/satisfiability-of-equality-equations) | [Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) | `Union Find`,`Graph`,`Array`,`String` | Medium | |
| [0991](https://leetcode.com/problems/broken-calculator) | [Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) | `Greedy`,`Math` | Medium | |
| [0992](https://leetcode.com/problems/subarrays-with-k-different-integers) | [Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sliding Window` | Hard | |
@@ -1384,6 +1385,7 @@ Press Control+F(or Command+F on the
| [1376](https://leetcode.com/problems/time-needed-to-inform-all-employees) | [Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Medium | |
| [1377](https://leetcode.com/problems/frog-position-after-t-seconds) | [Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Hard | |
| [1378](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier) | [Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README_EN.md) | `Database` | Easy | 🔒 |
+| [1379](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree) | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | |
| [1380](https://leetcode.com/problems/lucky-numbers-in-a-matrix) | [Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | |
| [1381](https://leetcode.com/problems/design-a-stack-with-increment-operation) | [Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) | `Stack`,`Design`,`Array` | Medium | |
| [1382](https://leetcode.com/problems/balance-a-binary-search-tree) | [Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) | `Greedy`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Divide and Conquer`,`Binary Tree` | Medium | |
@@ -1405,6 +1407,7 @@ Press Control+F(or Command+F on the
| [1398](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c) | [Customers Who Bought Products A and B but Not C](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README_EN.md) | `Database` | Medium | 🔒 |
| [1399](https://leetcode.com/problems/count-largest-group) | [Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) | `Hash Table`,`Math` | Easy | |
| [1400](https://leetcode.com/problems/construct-k-palindrome-strings) | [Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting` | Medium | |
+| [1401](https://leetcode.com/problems/circle-and-rectangle-overlapping) | [Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) | `Geometry`,`Math` | Medium | |
| [1402](https://leetcode.com/problems/reducing-dishes) | [Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Hard | |
| [1403](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order) | [Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | |
| [1404](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one) | [Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) | `Bit Manipulation`,`String` | Medium | |
@@ -1701,6 +1704,7 @@ Press Control+F(or Command+F on the
| [1695](https://leetcode.com/problems/maximum-erasure-value) | [Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | |
| [1696](https://leetcode.com/problems/jump-game-vi) | [Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | |
| [1697](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths) | [Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) | `Union Find`,`Graph`,`Array`,`Sorting` | Hard | |
+| [1698](https://leetcode.com/problems/number-of-distinct-substrings-in-a-string) | [Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README_EN.md) | `Trie`,`String`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Medium | 🔒 |
| [1699](https://leetcode.com/problems/number-of-calls-between-two-persons) | [Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md) | `Database` | Medium | 🔒 |
| [1700](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch) | [Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) | `Stack`,`Queue`,`Array`,`Simulation` | Easy | |
| [1701](https://leetcode.com/problems/average-waiting-time) | [Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) | `Array`,`Simulation` | Medium | |
@@ -1737,11 +1741,14 @@ Press Control+F(or Command+F on the
| [1732](https://leetcode.com/problems/find-the-highest-altitude) | [Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) | `Array`,`Prefix Sum` | Easy | |
| [1733](https://leetcode.com/problems/minimum-number-of-people-to-teach) | [Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) | `Greedy`,`Array` | Medium | |
| [1734](https://leetcode.com/problems/decode-xored-permutation) | [Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | |
+| [1735](https://leetcode.com/problems/count-ways-to-make-array-with-product) | [Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Hard | |
+| [1736](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits) | [Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) | `String` | Easy | |
| [1737](https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions) | [Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | |
| [1738](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value) | [Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) | `Bit Manipulation`,`Array`,`Divide and Conquer`,`Matrix`,`Prefix Sum`,`Quickselect`,`Heap (Priority Queue)` | Medium | |
| [1739](https://leetcode.com/problems/building-boxes) | [Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) | `Greedy`,`Math`,`Binary Search` | Hard | |
| [1740](https://leetcode.com/problems/find-distance-in-a-binary-tree) | [Find Distance in a Binary Tree](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 |
| [1741](https://leetcode.com/problems/find-total-time-spent-by-each-employee) | [Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README_EN.md) | `Database` | Easy | |
+| [1742](https://leetcode.com/problems/maximum-number-of-balls-in-a-box) | [Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) | `Hash Table`,`Math`,`Counting` | Easy | |
| [1743](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs) | [Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) | `Array`,`Hash Table` | Medium | |
| [1744](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day) | [Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) | `Array`,`Prefix Sum` | Medium | |
| [1745](https://leetcode.com/problems/palindrome-partitioning-iv) | [Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) | `String`,`Dynamic Programming` | Hard | |
@@ -1750,6 +1757,7 @@ Press Control+F(or Command+F on the
| [1748](https://leetcode.com/problems/sum-of-unique-elements) | [Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | |
| [1749](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray) | [Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | |
| [1750](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends) | [Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) | `Two Pointers`,`String` | Medium | |
+| [1751](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii) | [Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Hard | |
| [1752](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated) | [Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) | `Array` | Easy | |
| [1753](https://leetcode.com/problems/maximum-score-from-removing-stones) | [Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) | `Greedy`,`Math`,`Heap (Priority Queue)` | Medium | |
| [1754](https://leetcode.com/problems/largest-merge-of-two-strings) | [Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | |
@@ -2125,6 +2133,7 @@ Press Control+F(or Command+F on the
| [2124](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs) | [Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) | `String` | Easy | |
| [2125](https://leetcode.com/problems/number-of-laser-beams-in-a-bank) | [Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) | `Array`,`Math`,`String`,`Matrix` | Medium | |
| [2126](https://leetcode.com/problems/destroying-asteroids) | [Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | |
+| [2127](https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting) | [Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | |
| [2128](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips) | [Remove All Ones With Row and Column Flips](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Medium | 🔒 |
| [2129](https://leetcode.com/problems/capitalize-the-title) | [Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) | `String` | Easy | |
| [2130](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list) | [Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Two Pointers` | Medium | |
@@ -2227,11 +2236,13 @@ Press Control+F(or Command+F on the
| [2227](https://leetcode.com/problems/encrypt-and-decrypt-strings) | [Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | |
| [2228](https://leetcode.com/problems/users-with-two-purchases-within-seven-days) | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md) | `Database` | Medium | 🔒 |
| [2229](https://leetcode.com/problems/check-if-an-array-is-consecutive) | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md) | `Array` | Easy | 🔒 |
-| [2230](https://leetcode.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | | Easy | 🔒 |
-| [2231](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity) | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | | Easy | |
-| [2232](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression) | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | | Medium | |
-| [2233](https://leetcode.com/problems/maximum-product-after-k-increments) | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | | Medium | |
-| [2234](https://leetcode.com/problems/maximum-total-beauty-of-the-gardens) | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | | Hard | |
+| [2230](https://leetcode.com/problems/the-users-that-are-eligible-for-discount) | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 |
+| [2231](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity) | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | `Sorting`,`Heap (Priority Queue)` | Easy | |
+| [2232](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression) | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | `String`,`Enumeration` | Medium | |
+| [2233](https://leetcode.com/problems/maximum-product-after-k-increments) | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | |
+| [2234](https://leetcode.com/problems/maximum-total-beauty-of-the-gardens) | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | |
+| [2235](https://leetcode.com/problems/add-two-integers) | [Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) | `Math` | Easy | |
+| [2236](https://leetcode.com/problems/root-equals-sum-of-children) | [Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) | `Tree`,`Binary Tree` | Easy | |
## Copyright
diff --git a/solution/summary.md b/solution/summary.md
index 9ddfe01a9cb94..5ee1ab581c365 100644
--- a/solution/summary.md
+++ b/solution/summary.md
@@ -221,7 +221,7 @@
- [0215.数组中的第K个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md)
- [0216.组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
- [0217.存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md)
- - [0218.The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md)
+ - [0218.天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md)
- [0219.存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md)
- [0220.存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md)
- [0221.最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md)
@@ -591,7 +591,7 @@
- [0579.查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md)
- [0580.统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md)
- [0581.最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md)
- - [0582.Kill Process](/solution/0500-0599/0582.Kill%20Process/README.md)
+ - [0582.杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md)
- [0583.两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md)
- [0584.寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md)
- [0585.2016年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md)
@@ -689,7 +689,7 @@
- [0675.为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md)
- [0676.实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md)
- [0677.键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md)
- - [0678.Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
+ - [0678.有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
- [0679.24 点游戏](/solution/0600-0699/0679.24%20Game/README.md)
- [0680.验证回文字符串 Ⅱ](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md)
- [0681.最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md)
@@ -930,7 +930,7 @@
- [0910.最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md)
- [0911.在线选举](/solution/0900-0999/0911.Online%20Election/README.md)
- [0912.排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md)
- - [0913.猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md)
+ - [0913.Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md)
- [0914.卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md)
- [0915.分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md)
- [0916.单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md)
@@ -1006,7 +1006,7 @@
- [0986.区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md)
- [0987.二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md)
- [0988.从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md)
- - [0989.数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md)
+ - [0989.Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md)
- [0990.等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md)
- [0991.坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md)
- [0992.K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md)
@@ -1404,7 +1404,7 @@
- [1376.通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md)
- [1377.T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md)
- [1378.使用唯一标识码替换员工ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md)
- - [1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md)
+ - [1379.找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md)
- [1380.矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md)
- [1381.设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md)
- [1382.将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md)
@@ -1428,7 +1428,7 @@
- 1400-1499
- [1400.构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md)
- - [1401.Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md)
+ - [1401.圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md)
- [1402.做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md)
- [1403.非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md)
- [1404.将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md)
@@ -1729,7 +1729,7 @@
- [1695.删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md)
- [1696.跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md)
- [1697.检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md)
- - [1698.Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md)
+ - [1698.字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md)
- [1699.两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md)
- 1700-1799
@@ -1768,14 +1768,14 @@
- [1732.找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md)
- [1733.需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md)
- [1734.解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md)
- - [1735.Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md)
- - [1736.Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md)
+ - [1735.生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md)
+ - [1736.替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md)
- [1737.满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md)
- [1738.找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md)
- [1739.放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md)
- [1740.找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md)
- [1741.查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md)
- - [1742.Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md)
+ - [1742.盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md)
- [1743.从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md)
- [1744.你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md)
- [1745.回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md)
@@ -1784,7 +1784,7 @@
- [1748.唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md)
- [1749.任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md)
- [1750.删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md)
- - [1751.Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
+ - [1751.最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
- [1752.检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md)
- [1753.移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md)
- [1754.构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md)
@@ -2168,7 +2168,7 @@
- [2124.检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md)
- [2125.银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md)
- [2126.摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md)
- - [2127.Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md)
+ - [2127.参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md)
- [2128.通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md)
- [2129.将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md)
- [2130.链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md)
@@ -2278,3 +2278,5 @@
- [2232.向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md)
- [2233.K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md)
- [2234.花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md)
+ - [2235.两整数相加](/solution/2200-2299/2235.Add%20Two%20Integers/README.md)
+ - [2236.判断根结点是否等于子结点之和](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md)
diff --git a/solution/summary_en.md b/solution/summary_en.md
index 320ffb123c0a2..8de2635bfa7fc 100644
--- a/solution/summary_en.md
+++ b/solution/summary_en.md
@@ -2278,3 +2278,5 @@
- [2232.Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md)
- [2233.Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md)
- [2234.Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md)
+ - [2235.Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md)
+ - [2236.Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md)