feat: add solutions to lc problem: No.3764

solution/2200-2299/2209.Minimum White Tiles After Covering With Carpets/README_EN.md

@@ -37,7 +37,7 @@ tags:
 <pre>
 <strong>Input:</strong> floor = &quot;10110101&quot;, numCarpets = 2, carpetLen = 2
 <strong>Output:</strong> 2
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The figure above shows one way of covering the tiles with the carpets such that only 2 white tiles are visible.
 No other way of covering the tiles with the carpets can leave less than 2 white tiles visible.
 </pre>
@@ -47,7 +47,7 @@ No other way of covering the tiles with the carpets can leave less than 2 white
 <pre>
 <strong>Input:</strong> floor = &quot;11111&quot;, numCarpets = 2, carpetLen = 3
 <strong>Output:</strong> 0
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The figure above shows one way of covering the tiles with the carpets such that no white tiles are visible.
 Note that the carpets are able to overlap one another.
 </pre>

solution/2200-2299/2211.Count Collisions on a Road/README_EN.md

@@ -47,7 +47,7 @@ The collisions that will happen on the road are:
 - Cars 2 and 3 will collide with each other. Since car 3 is stationary, the number of collisions becomes 2 + 1 = 3.
 - Cars 3 and 4 will collide with each other. Since car 3 is stationary, the number of collisions becomes 3 + 1 = 4.
 - Cars 4 and 5 will collide with each other. After car 4 collides with car 3, it will stay at the point of collision and get hit by car 5. The number of collisions becomes 4 + 1 = 5.
-Thus, the total number of collisions that will happen on the road is 5.
+Thus, the total number of collisions that will happen on the road is 5. 
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>

solution/3700-3799/3759.Count Elements With at Least K Greater Values/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3759.Count%20Elements%20With%20at%20Least%20K%20Greater%20Values/README.md
+rating: 1372
+source: 第 478 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3759.Count Elements With at Least K Greater Values/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3759.Count%20Elements%20With%20at%20Least%20K%20Greater%20Values/README_EN.md
+rating: 1372
+source: Weekly Contest 478 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3760.Maximum Substrings With Distinct Start/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3760.Maximum%20Substrings%20With%20Distinct%20Start/README.md
+rating: 1364
+source: 第 478 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3760.Maximum Substrings With Distinct Start/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3760.Maximum%20Substrings%20With%20Distinct%20Start/README_EN.md
+rating: 1364
+source: Weekly Contest 478 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3761.Minimum%20Absolute%20Distance%20Between%20Mirror%20Pairs/README.md
+rating: 1668
+source: 第 478 场周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3761.Minimum%20Absolute%20Distance%20Between%20Mirror%20Pairs/README_EN.md
+rating: 1668
+source: Weekly Contest 478 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3762.Minimum Operations to Equalize Subarrays/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3762.Minimum%20Operations%20to%20Equalize%20Subarrays/README.md
+rating: 2497
+source: 第 478 场周赛 Q4
 ---
 
 <!-- problem:start -->

solution/3700-3799/3762.Minimum Operations to Equalize Subarrays/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3762.Minimum%20Operations%20to%20Equalize%20Subarrays/README_EN.md
+rating: 2497
+source: Weekly Contest 478 Q4
 ---
 
 <!-- problem:start -->

solution/3700-3799/3764.Most Common Course Pairs/README.md

@@ -0,0 +1,199 @@
+---
+comments: true
+difficulty: 困难
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3764.Most%20Common%20Course%20Pairs/README.md
+tags:
+    - 数据库
+---
+
+<!-- problem:start -->
+
+# [3764. 最常见的课程组合](https://leetcode.cn/problems/most-common-course-pairs)
+
+[English Version](/solution/3700-3799/3764.Most%20Common%20Course%20Pairs/README_EN.md)
+
+## 题目描述
+
+<!-- description:start -->
+
+<p>表：<code>course_completions</code></p>
+
+<pre>
++-------------------+---------+
+| Column Name       | Type    |
++-------------------+---------+
+| user_id           | int     |
+| course_id         | int     |
+| course_name       | varchar |
+| completion_date   | date    |
+| course_rating     | int     |
++-------------------+---------+
+(user_id, course_id) 是此表中具有不同值的列的组合。
+每一行代表一个用户完成的课程及其评分（1-5 分）。
+</pre>
+
+<p>编写一个解决方案，通过分析顶尖学生完成课程的序列来识别 <strong>课程路径</strong>：</p>
+
+<ul>
+	<li>只考虑 <strong>顶尖学生</strong>（完成 <strong>至少</strong> <code>5</code> <strong>门课程且平均评分</strong> <code>4</code> <strong>分或以上&nbsp;</strong>的人）。</li>
+	<li>对每个顶尖学生，确定他们按时间顺序完成的 <strong>课程序列</strong>。</li>
+	<li>找出这些学生所学的所有 <strong>连续课程对&nbsp;</strong>（<code>课程 A → 课程 B</code>）。</li>
+	<li>返回课程对的频率，确定顶尖学生中最常见的课程路径。</li>
+</ul>
+
+<p>返回结果表，按课程对频率 <strong>降序</strong> 排列，若频率相同则按第一课程名称和第二课程名称 <strong>升序</strong> 排列。</p>
+
+<p>结果格式如下所示。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong></p>
+
+<p>course_completions 表：</p>
+
+<pre class="example-io">
++---------+-----------+------------------+-----------------+---------------+
+| user_id | course_id | course_name      | completion_date | course_rating |
++---------+-----------+------------------+-----------------+---------------+
+| 1       | 101       | Python Basics    | 2024-01-05      | 5             |
+| 1       | 102       | SQL Fundamentals | 2024-02-10      | 4             |
+| 1       | 103       | JavaScript       | 2024-03-15      | 5             |
+| 1       | 104       | React Basics     | 2024-04-20      | 4             |
+| 1       | 105       | Node.js          | 2024-05-25      | 5             |
+| 1       | 106       | Docker           | 2024-06-30      | 4             |
+| 2       | 101       | Python Basics    | 2024-01-08      | 4             |
+| 2       | 104       | React Basics     | 2024-02-14      | 5             |
+| 2       | 105       | Node.js          | 2024-03-20      | 4             |
+| 2       | 106       | Docker           | 2024-04-25      | 5             |
+| 2       | 107       | AWS Fundamentals | 2024-05-30      | 4             |
+| 3       | 101       | Python Basics    | 2024-01-10      | 3             |
+| 3       | 102       | SQL Fundamentals | 2024-02-12      | 3             |
+| 3       | 103       | JavaScript       | 2024-03-18      | 3             |
+| 3       | 104       | React Basics     | 2024-04-22      | 2             |
+| 3       | 105       | Node.js          | 2024-05-28      | 3             |
+| 4       | 101       | Python Basics    | 2024-01-12      | 5             |
+| 4       | 108       | Data Science     | 2024-02-16      | 5             |
+| 4       | 109       | Machine Learning | 2024-03-22      | 5             |
++---------+-----------+------------------+-----------------+---------------+
+</pre>
+
+<p><strong>输出：</strong></p>
+
+<pre class="example-io">
++------------------+------------------+------------------+
+| first_course     | second_course    | transition_count |
++------------------+------------------+------------------+
+| Node.js          | Docker           | 2                |
+| React Basics     | Node.js          | 2                |
+| Docker           | AWS Fundamentals | 1                |
+| JavaScript       | React Basics     | 1                |
+| Python Basics    | React Basics     | 1                |
+| Python Basics    | SQL Fundamentals | 1                |
+| SQL Fundamentals | JavaScript       | 1                |
++------------------+------------------+------------------+
+</pre>
+
+<p><strong>解释：</strong></p>
+
+<ul>
+	<li><strong>用户 1：</strong>完成了 6 门课程，平均分为 4.5（满足顶尖学生）</li>
+	<li><strong>用户 2：</strong>完成了 5 门课程，平均分为 4.4（满足顶尖学生）</li>
+	<li><strong>用户 3：</strong>完成了 5 门课程但平均得分为 2.8（不满足资格）</li>
+	<li><strong>用户 4：</strong>只完成了 3 门课程（不满足资格）</li>
+	<li><strong>顶尖学生的课程对：</strong>
+	<ul>
+		<li>用户 1：Python Basics → SQL Fundamentals → JavaScript → React Basics → Node.js → Docker</li>
+		<li>用户 2：Python Basics → React Basics → Node.js → Docker → AWS Fundamentals</li>
+		<li>最常见的路径：Node.js → Docker (2 次)，React Basics → Node.js (2 次)</li>
+	</ul>
+	</li>
+</ul>
+
+<p>结果按 transition_count 降序排列，然后按 first_course 升序排列，再按 second_course 升序排列。</p>
+</div>
+
+<!-- description:end -->
+
+## 解法
+
+<!-- solution:start -->
+
+### 方法一：分组统计
+
+我们首先筛选出所有顶尖学生，记为 `top_students`，即完成课程数不少于 5 且平均评分不少于 4 的学生。 然后对于每个顶尖学生，按完成时间排序，找出所有连续的课程对，记为 `course_pairs`。 最后对所有课程对进行分组统计，计算每个课程对的出现次数，并按要求排序输出结果。
+
+<!-- tabs:start -->
+
+#### MySQL
+
+```sql
+# Write your MySQL query statement below
+WITH
+    top_students AS (
+        SELECT user_id
+        FROM course_completions
+        GROUP BY user_id
+        HAVING COUNT(1) >= 5 AND AVG(course_rating) >= 4
+    ),
+    course_pairs AS (
+        SELECT
+            course_name AS first_course,
+            LEAD(course_name) OVER (
+                PARTITION BY user_id
+                ORDER BY completion_date
+            ) second_course
+        FROM
+            top_students
+            JOIN course_completions USING (user_id)
+    )
+SELECT
+    *,
+    COUNT(1) transition_count
+FROM course_pairs
+WHERE second_course IS NOT NULL
+GROUP BY 1, 2
+ORDER BY 3 DESC, 1, 2;
+```
+
+#### Pandas
+
+```python
+import pandas as pd
+
+
+def topLearnerCourseTransitions(course_completions: pd.DataFrame) -> pd.DataFrame:
+    grp = course_completions.groupby("user_id")
+    top_students = grp.filter(
+        lambda df: df.shape[0] >= 5 and df["course_rating"].mean() >= 4
+    )["user_id"].unique()
+
+    df = course_completions[course_completions["user_id"].isin(top_students)].copy()
+    df = df.sort_values(["user_id", "completion_date"])
+    df["second_course"] = df.groupby("user_id")["course_name"].shift(-1)
+    df["first_course"] = df["course_name"]
+
+    pairs = df[df["second_course"].notna()][["first_course", "second_course"]]
+
+    result = (
+        pairs.groupby(["first_course", "second_course"])
+        .size()
+        .reset_index(name="transition_count")
+        .sort_values(
+            ["transition_count", "first_course", "second_course"],
+            ascending=[False, True, True],
+            key=lambda col: col.str.lower() if col.dtype == "object" else col,
+        )
+        .reset_index(drop=True)
+    )
+
+    return result
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->