diff --git a/solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README.md b/solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README.md
new file mode 100644
index 0000000000000..91a92d2153813
--- /dev/null
+++ b/solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README.md
@@ -0,0 +1,119 @@
+---
+comments: true
+difficulty: 困难
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README.md
+---
+
+
+
+# [3506. Find Time Required to Eliminate Bacterial Strains II 🔒](https://leetcode.cn/problems/find-time-required-to-eliminate-bacterial-strains-ii)
+
+[English Version](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README_EN.md)
+
+## 题目描述
+
+
+
+You are given an integer array timeReq and an integer splitTime.
+
+In the microscopic world of the human body, the immune system faces an extraordinary challenge: combatting a rapidly multiplying bacterial colony that threatens the body's survival.
+
+Initially, only one white blood cell (WBC) is deployed to eliminate the bacteria. However, the lone WBC quickly realizes it cannot keep up with the bacterial growth rate.
+
+The WBC devises a clever strategy to fight the bacteria:
+
+
+ - The
ith bacterial strain takes timeReq[i] units of time to be eliminated.
+ - A single WBC can eliminate only one bacterial strain. Afterwards, the WBC is exhausted and cannot perform any other tasks.
+ - A WBC can split itself into two WBCs, but this requires
splitTime units of time. Once split, the two WBCs can work in parallel on eliminating the bacteria.
+ - Only one WBC can work on a single bacterial strain. Multiple WBCs cannot attack one strain in parallel.
+
+
+You must determine the minimum time required to eliminate all the bacterial strains.
+
+Note that the bacterial strains can be eliminated in any order.
+
+
+Example 1:
+
+
+
Input: timeReq = [10,4,5], splitTime = 2
+
+
Output: 12
+
+
Explanation:
+
+
The elimination process goes as follows:
+
+
+ - Initially, there is a single WBC. The WBC splits into 2 WBCs after 2 units of time.
+ - One of the WBCs eliminates strain 0 at a time
t = 2 + 10 = 12. The other WBC splits again, using 2 units of time.
+ - The 2 new WBCs eliminate the bacteria at times
t = 2 + 2 + 4 and t = 2 + 2 + 5.
+
+
Example 2:
+
+
+
Input: timeReq = [10,4], splitTime = 5
+
+
Output:15
+
+
Explanation:
+
+
The elimination process goes as follows:
+
+
+ - Initially, there is a single WBC. The WBC splits into 2 WBCs after 5 units of time.
+ - The 2 new WBCs eliminate the bacteria at times
t = 5 + 10 and t = 5 + 4.
+
+
+Constraints:
+
+
+ 2 <= timeReq.length <= 1051 <= timeReq[i] <= 1091 <= splitTime <= 109
+
+
+
+## 解法
+
+
+
+### 方法一
+
+
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+
+
+
+
+
diff --git a/solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README_EN.md b/solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README_EN.md
new file mode 100644
index 0000000000000..bcf5080a94591
--- /dev/null
+++ b/solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README_EN.md
@@ -0,0 +1,119 @@
+---
+comments: true
+difficulty: Hard
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README_EN.md
+---
+
+
+
+# [3506. Find Time Required to Eliminate Bacterial Strains II 🔒](https://leetcode.com/problems/find-time-required-to-eliminate-bacterial-strains-ii)
+
+[中文文档](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README.md)
+
+## Description
+
+
+
+You are given an integer array timeReq and an integer splitTime.
+
+In the microscopic world of the human body, the immune system faces an extraordinary challenge: combatting a rapidly multiplying bacterial colony that threatens the body's survival.
+
+Initially, only one white blood cell (WBC) is deployed to eliminate the bacteria. However, the lone WBC quickly realizes it cannot keep up with the bacterial growth rate.
+
+The WBC devises a clever strategy to fight the bacteria:
+
+
+ - The
ith bacterial strain takes timeReq[i] units of time to be eliminated.
+ - A single WBC can eliminate only one bacterial strain. Afterwards, the WBC is exhausted and cannot perform any other tasks.
+ - A WBC can split itself into two WBCs, but this requires
splitTime units of time. Once split, the two WBCs can work in parallel on eliminating the bacteria.
+ - Only one WBC can work on a single bacterial strain. Multiple WBCs cannot attack one strain in parallel.
+
+
+You must determine the minimum time required to eliminate all the bacterial strains.
+
+Note that the bacterial strains can be eliminated in any order.
+
+
+Example 1:
+
+
+
Input: timeReq = [10,4,5], splitTime = 2
+
+
Output: 12
+
+
Explanation:
+
+
The elimination process goes as follows:
+
+
+ - Initially, there is a single WBC. The WBC splits into 2 WBCs after 2 units of time.
+ - One of the WBCs eliminates strain 0 at a time
t = 2 + 10 = 12. The other WBC splits again, using 2 units of time.
+ - The 2 new WBCs eliminate the bacteria at times
t = 2 + 2 + 4 and t = 2 + 2 + 5.
+
+
Example 2:
+
+
+
Input: timeReq = [10,4], splitTime = 5
+
+
Output:15
+
+
Explanation:
+
+
The elimination process goes as follows:
+
+
+ - Initially, there is a single WBC. The WBC splits into 2 WBCs after 5 units of time.
+ - The 2 new WBCs eliminate the bacteria at times
t = 5 + 10 and t = 5 + 4.
+
+
+Constraints:
+
+
+ 2 <= timeReq.length <= 1051 <= timeReq[i] <= 1091 <= splitTime <= 109
+
+
+
+## Solutions
+
+
+
+### Solution 1
+
+
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+
+
+
+
+
diff --git a/solution/README.md b/solution/README.md
index 7931d360384df..7679fdb3c41b3 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -3516,6 +3516,7 @@
| 3503 | [子字符串连接后的最长回文串 I](/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README.md) | | 中等 | 第 443 场周赛 |
| 3504 | [子字符串连接后的最长回文串 II](/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README.md) | | 困难 | 第 443 场周赛 |
| 3505 | [使 K 个子数组内元素相等的最少操作数](/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README.md) | | 困难 | 第 443 场周赛 |
+| 3506 | [Find Time Required to Eliminate Bacterial Strains II](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README.md) | | 困难 | 🔒 |
## 版权
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 7ffd87a26bc75..def52d26ffde2 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -3514,6 +3514,7 @@ Press Control + F(or Command + F on
| 3503 | [Longest Palindrome After Substring Concatenation I](/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README_EN.md) | | Medium | Weekly Contest 443 |
| 3504 | [Longest Palindrome After Substring Concatenation II](/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README_EN.md) | | Hard | Weekly Contest 443 |
| 3505 | [Minimum Operations to Make Elements Within K Subarrays Equal](/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README_EN.md) | | Hard | Weekly Contest 443 |
+| 3506 | [Find Time Required to Eliminate Bacterial Strains II](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README_EN.md) | | Hard | 🔒 |
## Copyright