feat: add new lc problems

Author: yanglbme

solution/1200-1299/1240.Tiling a Rectangle with the Fewest Squares/README.md

@@ -57,7 +57,12 @@
 
 **方法一：递归回溯 + 状态压缩**
 
-我们可以按位置进行递归回溯。如果当前位置 $(i, j)$ 已经被填充，则直接递归到下一个位置 $(i, j + 1)$。否则，我们枚举当前位置 $(i, j)$ 可以填充的最大正方形的边长 $w$，并将当前位置 $(i, j)$ 到 $(i + w - 1, j + w - 1)$ 的位置全部填充，然后递归到下一个位置 $(i, j + w)$。在回溯时，我们需要将当前位置 $(i, j)$ 到 $(i + w - 1, j + w - 1)$ 的位置全部清空。
+我们可以按位置进行递归回溯，过程中我们用一个变量 $t$ 记录当前使用的瓷砖数。
+
+-   如果 $j = m$，即第 $i$ 行已经被完全填充，则递归到下一行，即 $(i + 1, 0)$。
+-   如果 $i = n$，则表示所有位置都已经被填充，我们更新答案并返回。
+-   如果当前位置 $(i, j)$ 已经被填充，则直接递归到下一个位置 $(i, j + 1)$。
+-   否则，我们枚举当前位置 $(i, j)$ 可以填充的最大正方形的边长 $w$，并将当前位置 $(i, j)$ 到 $(i + w - 1, j + w - 1)$ 的位置全部填充，然后递归到下一个位置 $(i, j + w)$。在回溯时，我们需要将当前位置 $(i, j)$ 到 $(i + w - 1, j + w - 1)$ 的位置全部清空。
 
 由于每个位置只有两种状态：填充或者未填充，因此我们可以使用一个整数来表示当前位置的状态。我们使用一个长度为 $n$ 的整数数组 $filled$，其中 $filled[i]$ 表示第 $i$ 行的状态。如果 $filled[i]$ 的第 $j$ 位为 $1$，则表示第 $i$ 行第 $j$ 列已经被填充，否则表示未填充。
 

solution/2700-2799/2720.Popularity Percentage/README.md

@@ -0,0 +1,89 @@
+# [2720. Popularity Percentage](https://leetcode.cn/problems/popularity-percentage)
+
+[English Version](/solution/2700-2799/2720.Popularity%20Percentage/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Table: <code>Friends</code></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| user1       | int  |
+| user2       | int  |
++-------------+------+
+(user1, user2) is the primary key of this table.
+Each row contains information about friendship where user1 and user2 are friends.
+</pre>
+
+<p>Write an SQL query to find the popularity percentage for each user on Meta/Facebook. The popularity percentage is defined as the total number of friends the user has divided by the total number of users on the platform, then converted into a percentage by multiplying by 100, <strong>rounded to 2 decimal places</strong>.</p>
+
+<p>Return <em>the result table ordered by</em> <code>user1</code> <em>in <strong>ascending</strong> order.</em></p>
+
+<p>The query result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong>&nbsp;
+Friends table:
++-------+-------+
+| user1 | user2 | 
++-------+-------+
+| 2 &nbsp; &nbsp; | 1 &nbsp; &nbsp; | 
+| 1 &nbsp; &nbsp; | 3 &nbsp; &nbsp; | 
+| 4 &nbsp; &nbsp; | 1 &nbsp; &nbsp; | 
+| 1 &nbsp; &nbsp; | 5 &nbsp; &nbsp; | 
+| 1 &nbsp; &nbsp; | 6 &nbsp; &nbsp; |
+| 2 &nbsp; &nbsp; | 6 &nbsp; &nbsp; | 
+| 7 &nbsp; &nbsp; | 2 &nbsp; &nbsp; | 
+| 8 &nbsp; &nbsp; | 3&nbsp; &nbsp; &nbsp;| 
+| 3 &nbsp; &nbsp; | 9 &nbsp; &nbsp; |  
++-------+-------+
+<strong>Output:</strong>&nbsp;
++-------+-----------------------+
+| user1 | percentage_popularity |
++-------+-----------------------+
+| 1     | 55.56 &nbsp;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;|
+| 2     | 33.33 &nbsp;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;|
+| 3     | 33.33   &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 4     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 5     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 6     | 22.22 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 7     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 8     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 9     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
++-------+-----------------------+
+<strong>Explanation:</strong>&nbsp;
+There are total 9 users on the platform.
+- User &quot;1&quot; has friendships with 2, 3, 4, 5 and 6. Therefore, the percentage popularity for user 1 would be calculated as (5/9) * 100 = 55.56.
+- User &quot;2&quot; has friendships with 1, 6 and 7. Therefore, the percentage popularity for user 2 would be calculated as (3/9) * 100 = 33.33.
+- User &quot;3&quot; has friendships with 1, 8 and 9. Therefore, the percentage popularity for user 3 would be calculated as (3/9) * 100 = 33.33.
+- User &quot;4&quot; has friendships with 1. Therefore, the percentage popularity for user 4 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;5&quot; has friendships with 1. Therefore, the percentage popularity for user 5 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;6&quot; has friendships with 1 and 2. Therefore, the percentage popularity for user 6 would be calculated as (2/9) * 100 = 22.22.
+- User &quot;7&quot; has friendships with 2. Therefore, the percentage popularity for user 7 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;8&quot; has friendships with 3. Therefore, the percentage popularity for user 8 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;9&quot; has friendships with 3. Therefore, the percentage popularity for user 9 would be calculated as (1/9) * 100 = 11.11.
+user1 is sorted in ascending order.
+</pre>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **SQL**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```sql
+
+```
+
+<!-- tabs:end -->

solution/2700-2799/2720.Popularity Percentage/README_EN.md

@@ -0,0 +1,83 @@
+# [2720. Popularity Percentage](https://leetcode.com/problems/popularity-percentage)
+
+[中文文档](/solution/2700-2799/2720.Popularity%20Percentage/README.md)
+
+## Description
+
+<p>Table: <code>Friends</code></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| user1       | int  |
+| user2       | int  |
++-------------+------+
+(user1, user2) is the primary key of this table.
+Each row contains information about friendship where user1 and user2 are friends.
+</pre>
+
+<p>Write an SQL query to find the popularity percentage for each user on Meta/Facebook. The popularity percentage is defined as the total number of friends the user has divided by the total number of users on the platform, then converted into a percentage by multiplying by 100, <strong>rounded to 2 decimal places</strong>.</p>
+
+<p>Return <em>the result table ordered by</em> <code>user1</code> <em>in <strong>ascending</strong> order.</em></p>
+
+<p>The query result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong>&nbsp;
+Friends table:
++-------+-------+
+| user1 | user2 | 
++-------+-------+
+| 2 &nbsp; &nbsp; | 1 &nbsp; &nbsp; | 
+| 1 &nbsp; &nbsp; | 3 &nbsp; &nbsp; | 
+| 4 &nbsp; &nbsp; | 1 &nbsp; &nbsp; | 
+| 1 &nbsp; &nbsp; | 5 &nbsp; &nbsp; | 
+| 1 &nbsp; &nbsp; | 6 &nbsp; &nbsp; |
+| 2 &nbsp; &nbsp; | 6 &nbsp; &nbsp; | 
+| 7 &nbsp; &nbsp; | 2 &nbsp; &nbsp; | 
+| 8 &nbsp; &nbsp; | 3&nbsp; &nbsp; &nbsp;| 
+| 3 &nbsp; &nbsp; | 9 &nbsp; &nbsp; |  
++-------+-------+
+<strong>Output:</strong>&nbsp;
++-------+-----------------------+
+| user1 | percentage_popularity |
++-------+-----------------------+
+| 1     | 55.56 &nbsp;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;|
+| 2     | 33.33 &nbsp;  &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;|
+| 3     | 33.33   &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 4     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 5     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 6     | 22.22 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 7     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 8     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
+| 9     | 11.11 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; |
++-------+-----------------------+
+<strong>Explanation:</strong>&nbsp;
+There are total 9 users on the platform.
+- User &quot;1&quot; has friendships with 2, 3, 4, 5 and 6. Therefore, the percentage popularity for user 1 would be calculated as (5/9) * 100 = 55.56.
+- User &quot;2&quot; has friendships with 1, 6 and 7. Therefore, the percentage popularity for user 2 would be calculated as (3/9) * 100 = 33.33.
+- User &quot;3&quot; has friendships with 1, 8 and 9. Therefore, the percentage popularity for user 3 would be calculated as (3/9) * 100 = 33.33.
+- User &quot;4&quot; has friendships with 1. Therefore, the percentage popularity for user 4 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;5&quot; has friendships with 1. Therefore, the percentage popularity for user 5 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;6&quot; has friendships with 1 and 2. Therefore, the percentage popularity for user 6 would be calculated as (2/9) * 100 = 22.22.
+- User &quot;7&quot; has friendships with 2. Therefore, the percentage popularity for user 7 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;8&quot; has friendships with 3. Therefore, the percentage popularity for user 8 would be calculated as (1/9) * 100 = 11.11.
+- User &quot;9&quot; has friendships with 3. Therefore, the percentage popularity for user 9 would be calculated as (1/9) * 100 = 11.11.
+user1 is sorted in ascending order.
+</pre>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **SQL**
+
+```sql
+
+```
+
+<!-- tabs:end -->

solution/2700-2799/2721.Execute Asynchronous Functions in Parallel/README.md

@@ -0,0 +1,84 @@
+# [2721. Execute Asynchronous Functions in Parallel](https://leetcode.cn/problems/execute-asynchronous-functions-in-parallel)
+
+[English Version](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>Given an array of asynchronous&nbsp;functions&nbsp;<code>functions</code>, return a new promise <code>promise</code>. Each function in the array accepts no arguments&nbsp;and returns a promise.</p>
+
+<p><code>promise</code> resolves:</p>
+
+<ul>
+	<li>When all the promises returned from&nbsp;<code>functions</code>&nbsp;were resolved successfully.&nbsp;The resolved&nbsp;value of&nbsp;<code>promise</code> should be an array of all the resolved values of promises in the same order as they were in the&nbsp;<code>functions.</code></li>
+</ul>
+
+<p><code>promise</code> rejects:</p>
+
+<ul>
+	<li>When any&nbsp;of the promises&nbsp;returned from&nbsp;<code>functions</code>&nbsp;were rejected.&nbsp;<code>promise</code> should also&nbsp;reject&nbsp;with the reason of the first rejection.</li>
+</ul>
+
+<p>Please solve it without using the built-in&nbsp;<code>Promise.all</code>&nbsp;function.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> functions = [
+&nbsp; () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(5), 200))
+]
+<strong>Output:</strong> {&quot;t&quot;: 200, &quot;resolved&quot;: [5]}
+<strong>Explanation:</strong> 
+promiseAll(functions).then(console.log); // [5]
+
+The single function was resolved at 200ms with a value of 5.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> functions = [
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(1), 200)), 
+    () =&gt; new Promise((resolve, reject) =&gt; setTimeout(() =&gt; reject(&quot;Error&quot;), 100))
+]
+<strong>Output:</strong> {&quot;t&quot;: 100, &quot;rejected&quot;: &quot;Error&quot;}
+<strong>Explanation:</strong> Since one of the promises rejected, the returned promise also rejected with the same error at the same time.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> functions = [
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(4), 50)), 
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(10), 150)), 
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(16), 100))
+]
+<strong>Output:</strong> {&quot;t&quot;: 150, &quot;resolved&quot;: [4, 10, 16]}
+<strong>Explanation:</strong> All the promises resolved with a value. The returned promise resolved when the last promise resolved.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>functions&nbsp;is an array of functions that returns promises</code></li>
+	<li><code>1 &lt;= functions.length &lt;= 10</code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **TypeScript**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```ts
+
+```
+
+<!-- tabs:end -->

solution/2700-2799/2721.Execute Asynchronous Functions in Parallel/README_EN.md

@@ -0,0 +1,78 @@
+# [2721. Execute Asynchronous Functions in Parallel](https://leetcode.com/problems/execute-asynchronous-functions-in-parallel)
+
+[中文文档](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README.md)
+
+## Description
+
+<p>Given an array of asynchronous&nbsp;functions&nbsp;<code>functions</code>, return a new promise <code>promise</code>. Each function in the array accepts no arguments&nbsp;and returns a promise.</p>
+
+<p><code>promise</code> resolves:</p>
+
+<ul>
+	<li>When all the promises returned from&nbsp;<code>functions</code>&nbsp;were resolved successfully.&nbsp;The resolved&nbsp;value of&nbsp;<code>promise</code> should be an array of all the resolved values of promises in the same order as they were in the&nbsp;<code>functions.</code></li>
+</ul>
+
+<p><code>promise</code> rejects:</p>
+
+<ul>
+	<li>When any&nbsp;of the promises&nbsp;returned from&nbsp;<code>functions</code>&nbsp;were rejected.&nbsp;<code>promise</code> should also&nbsp;reject&nbsp;with the reason of the first rejection.</li>
+</ul>
+
+<p>Please solve it without using the built-in&nbsp;<code>Promise.all</code>&nbsp;function.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> functions = [
+&nbsp; () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(5), 200))
+]
+<strong>Output:</strong> {&quot;t&quot;: 200, &quot;resolved&quot;: [5]}
+<strong>Explanation:</strong> 
+promiseAll(functions).then(console.log); // [5]
+
+The single function was resolved at 200ms with a value of 5.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> functions = [
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(1), 200)), 
+    () =&gt; new Promise((resolve, reject) =&gt; setTimeout(() =&gt; reject(&quot;Error&quot;), 100))
+]
+<strong>Output:</strong> {&quot;t&quot;: 100, &quot;rejected&quot;: &quot;Error&quot;}
+<strong>Explanation:</strong> Since one of the promises rejected, the returned promise also rejected with the same error at the same time.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> functions = [
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(4), 50)), 
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(10), 150)), 
+    () =&gt; new Promise(resolve =&gt; setTimeout(() =&gt; resolve(16), 100))
+]
+<strong>Output:</strong> {&quot;t&quot;: 150, &quot;resolved&quot;: [4, 10, 16]}
+<strong>Explanation:</strong> All the promises resolved with a value. The returned promise resolved when the last promise resolved.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>functions&nbsp;is an array of functions that returns promises</code></li>
+	<li><code>1 &lt;= functions.length &lt;= 10</code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **TypeScript**
+
+```ts
+
+```
+
+<!-- tabs:end -->