feat: add solutions to lc problems

* No.2299.Strong Password Checker II
* No.2300.Successful Pairs of Spells and Potions
* No.2301.Match Substring After Replacement
* No.2302.Count Subarrays With Score Less Than K
* No.2303.Calculate Amount Paid in Taxes
* No.2304.Minimum Path Cost in a Grid
* No.2305.Fair Distribution of Cookies
* No.2306.Naming a Company

Author: yanglbme

solution/2200-2299/2297.Jump Game IX/README.md

@@ -0,0 +1,89 @@
+# [2297. Jump Game IX](https://leetcode.cn/problems/jump-game-ix)
+
+[English Version](/solution/2200-2299/2297.Jump%20Game%20IX/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> of length <code>n</code>. You are initially standing at index <code>0</code>. You can jump from index <code>i</code> to index <code>j</code> where <code>i &lt; j</code> if:</p>
+
+<ul>
+	<li><code>nums[i] &lt;= nums[j]</code> and <code>nums[k] &lt; nums[i]</code> for all indexes <code>k</code> in the range <code>i &lt; k &lt; j</code>, or</li>
+	<li><code>nums[i] &gt; nums[j]</code> and <code>nums[k] &gt;= nums[i]</code> for all indexes <code>k</code> in the range <code>i &lt; k &lt; j</code>.</li>
+</ul>
+
+<p>You are also given an integer array <code>costs</code> of length <code>n</code> where <code>costs[i]</code> denotes the cost of jumping <strong>to</strong> index <code>i</code>.</p>
+
+<p>Return <em>the <strong>minimum</strong> cost to jump to the index </em><code>n - 1</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [3,2,4,4,1], costs = [3,7,6,4,2]
+<strong>Output:</strong> 8
+<strong>Explanation:</strong> You start at index 0.
+- Jump to index 2 with a cost of costs[2] = 6.
+- Jump to index 4 with a cost of costs[4] = 2.
+The total cost is 8. It can be proven that 8 is the minimum cost needed.
+Two other possible paths are from index 0 -&gt; 1 -&gt; 4 and index 0 -&gt; 2 -&gt; 3 -&gt; 4.
+These have a total cost of 9 and 12, respectively.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,1,2], costs = [1,1,1]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> Start at index 0.
+- Jump to index 1 with a cost of costs[1] = 1.
+- Jump to index 2 with a cost of costs[2] = 1.
+The total cost is 2. Note that you cannot jump directly from index 0 to index 2 because nums[0] &lt;= nums[1].
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == nums.length == costs.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= nums[i], costs[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2297.Jump Game IX/README_EN.md

@@ -0,0 +1,81 @@
+# [2297. Jump Game IX](https://leetcode.com/problems/jump-game-ix)
+
+[中文文档](/solution/2200-2299/2297.Jump%20Game%20IX/README.md)
+
+## Description
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> of length <code>n</code>. You are initially standing at index <code>0</code>. You can jump from index <code>i</code> to index <code>j</code> where <code>i &lt; j</code> if:</p>
+
+<ul>
+	<li><code>nums[i] &lt;= nums[j]</code> and <code>nums[k] &lt; nums[i]</code> for all indexes <code>k</code> in the range <code>i &lt; k &lt; j</code>, or</li>
+	<li><code>nums[i] &gt; nums[j]</code> and <code>nums[k] &gt;= nums[i]</code> for all indexes <code>k</code> in the range <code>i &lt; k &lt; j</code>.</li>
+</ul>
+
+<p>You are also given an integer array <code>costs</code> of length <code>n</code> where <code>costs[i]</code> denotes the cost of jumping <strong>to</strong> index <code>i</code>.</p>
+
+<p>Return <em>the <strong>minimum</strong> cost to jump to the index </em><code>n - 1</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [3,2,4,4,1], costs = [3,7,6,4,2]
+<strong>Output:</strong> 8
+<strong>Explanation:</strong> You start at index 0.
+- Jump to index 2 with a cost of costs[2] = 6.
+- Jump to index 4 with a cost of costs[4] = 2.
+The total cost is 8. It can be proven that 8 is the minimum cost needed.
+Two other possible paths are from index 0 -&gt; 1 -&gt; 4 and index 0 -&gt; 2 -&gt; 3 -&gt; 4.
+These have a total cost of 9 and 12, respectively.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,1,2], costs = [1,1,1]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> Start at index 0.
+- Jump to index 1 with a cost of costs[1] = 1.
+- Jump to index 2 with a cost of costs[2] = 1.
+The total cost is 2. Note that you cannot jump directly from index 0 to index 2 because nums[0] &lt;= nums[1].
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == nums.length == costs.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= nums[i], costs[i] &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2298.Tasks Count in the Weekend/README.md

@@ -0,0 +1,104 @@
+# [2298. Tasks Count in the Weekend](https://leetcode.cn/problems/tasks-count-in-the-weekend)
+
+[English Version](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Table: <code>Tasks</code></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| task_id     | int  |
+| assignee_id | int  |
+| submit_date | date |
++-------------+------+
+task_id is the primary key for this table.
+Each row in this table contains the ID of a task, the id of the assignee, and the submission date.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>Write an SQL query to report:</p>
+
+<ul>
+	<li>the number of the tasks that were submitted during the weekend (Saturday, Sunday) as <code>weekend_cnt</code>, and</li>
+	<li>the number of the tasks that were submitted during the working days as <code>working_cnt</code>.</li>
+</ul>
+
+<p>Return the result table in <strong>any order</strong>.</p>
+
+<p>The query result format is shown in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Tasks table:
++---------+-------------+-------------+
+| task_id | assignee_id | submit_date |
++---------+-------------+-------------+
+| 1       | 1           | 2022-06-13  |
+| 2       | 6           | 2022-06-14  |
+| 3       | 6           | 2022-06-15  |
+| 4       | 3           | 2022-06-18  |
+| 5       | 5           | 2022-06-19  |
+| 6       | 7           | 2022-06-19  |
++---------+-------------+-------------+
+<strong>Output:</strong> 
++-------------+-------------+
+| weekend_cnt | working_cnt |
++-------------+-------------+
+| 3           | 3           |
++-------------+-------------+
+<strong>Explanation:</strong> 
+Task 1 was submitted on Monday.
+Task 2 was submitted on Tuesday.
+Task 3 was submitted on Wednesday.
+Task 4 was submitted on Saturday.
+Task 5 was submitted on Sunday.
+Task 6 was submitted on Sunday.
+3 tasks were submitted during the weekends.
+3 tasks were submitted during the working days.
+</pre>
+
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2200-2299/2298.Tasks Count in the Weekend/README_EN.md

@@ -0,0 +1,96 @@
+# [2298. Tasks Count in the Weekend](https://leetcode.com/problems/tasks-count-in-the-weekend)
+
+[中文文档](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README.md)
+
+## Description
+
+<p>Table: <code>Tasks</code></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| task_id     | int  |
+| assignee_id | int  |
+| submit_date | date |
++-------------+------+
+task_id is the primary key for this table.
+Each row in this table contains the ID of a task, the id of the assignee, and the submission date.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>Write an SQL query to report:</p>
+
+<ul>
+	<li>the number of the tasks that were submitted during the weekend (Saturday, Sunday) as <code>weekend_cnt</code>, and</li>
+	<li>the number of the tasks that were submitted during the working days as <code>working_cnt</code>.</li>
+</ul>
+
+<p>Return the result table in <strong>any order</strong>.</p>
+
+<p>The query result format is shown in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Tasks table:
++---------+-------------+-------------+
+| task_id | assignee_id | submit_date |
++---------+-------------+-------------+
+| 1       | 1           | 2022-06-13  |
+| 2       | 6           | 2022-06-14  |
+| 3       | 6           | 2022-06-15  |
+| 4       | 3           | 2022-06-18  |
+| 5       | 5           | 2022-06-19  |
+| 6       | 7           | 2022-06-19  |
++---------+-------------+-------------+
+<strong>Output:</strong> 
++-------------+-------------+
+| weekend_cnt | working_cnt |
++-------------+-------------+
+| 3           | 3           |
++-------------+-------------+
+<strong>Explanation:</strong> 
+Task 1 was submitted on Monday.
+Task 2 was submitted on Tuesday.
+Task 3 was submitted on Wednesday.
+Task 4 was submitted on Saturday.
+Task 5 was submitted on Sunday.
+Task 6 was submitted on Sunday.
+3 tasks were submitted during the weekends.
+3 tasks were submitted during the working days.
+</pre>
+
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->