feat: add weekly contest 406 (#3272)

doocs · Jul 14, 2024 · 6966d28 · 6966d28
1 parent eca2a78
commit 6966d28
Show file tree

Hide file tree

Showing 70 changed files with 2,174 additions and 1 deletion.
diff --git a/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README.md b/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README.md
+rating: 1149
+source: 第 402 场周赛 Q1
 tags:
     - 数组
     - 哈希表

diff --git a/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README_EN.md b/solution/3100-3199/3184.Count Pairs That Form a Complete Day I/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md
+rating: 1149
+source: Weekly Contest 402 Q1
 tags:
     - Array
     - Hash Table

diff --git a/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README.md b/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README.md
+rating: 1385
+source: 第 402 场周赛 Q2
 tags:
     - 数组
     - 哈希表

diff --git a/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README_EN.md b/solution/3100-3199/3185.Count Pairs That Form a Complete Day II/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md
+rating: 1385
+source: Weekly Contest 402 Q2
 tags:
     - Array
     - Hash Table

diff --git a/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README.md b/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README.md
+rating: 1840
+source: 第 402 场周赛 Q3
 tags:
     - 数组
     - 哈希表

diff --git a/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README_EN.md b/solution/3100-3199/3186.Maximum Total Damage With Spell Casting/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md
+rating: 1840
+source: Weekly Contest 402 Q3
 tags:
     - Array
     - Hash Table

diff --git a/solution/3100-3199/3187.Peaks in Array/README.md b/solution/3100-3199/3187.Peaks in Array/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3187.Peaks%20in%20Array/README.md
+rating: 2154
+source: 第 402 场周赛 Q4
 tags:
     - 树状数组
     - 线段树

diff --git a/solution/3100-3199/3187.Peaks in Array/README_EN.md b/solution/3100-3199/3187.Peaks in Array/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md
+rating: 2154
+source: Weekly Contest 402 Q4
 tags:
     - Binary Indexed Tree
     - Segment Tree

diff --git a/.../3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md b/.../3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3190.Find%20Minimum%20Operations%20to%20Make%20All%20Elements%20Divisible%20by%20Three/README.md
+rating: 1139
+source: 第 133 场双周赛 Q1
 tags:
     - 数组
     - 数学

diff --git a/...90.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md b/...90.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3190.Find%20Minimum%20Operations%20to%20Make%20All%20Elements%20Divisible%20by%20Three/README_EN.md
+rating: 1139
+source: Biweekly Contest 133 Q1
 tags:
     - Array
     - Math

diff --git a/.../3191.Minimum Operations to Make Binary Array Elements Equal to One I/README.md b/.../3191.Minimum Operations to Make Binary Array Elements Equal to One I/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3191.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20I/README.md
+rating: 1311
+source: 第 133 场双周赛 Q2
 tags:
     - 位运算
     - 队列

diff --git a/...91.Minimum Operations to Make Binary Array Elements Equal to One I/README_EN.md b/...91.Minimum Operations to Make Binary Array Elements Equal to One I/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3191.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20I/README_EN.md
+rating: 1311
+source: Biweekly Contest 133 Q2
 tags:
     - Bit Manipulation
     - Queue

diff --git a/...3192.Minimum Operations to Make Binary Array Elements Equal to One II/README.md b/...3192.Minimum Operations to Make Binary Array Elements Equal to One II/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3192.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20II/README.md
+rating: 1432
+source: 第 133 场双周赛 Q3
 tags:
     - 贪心
     - 数组

diff --git a/...2.Minimum Operations to Make Binary Array Elements Equal to One II/README_EN.md b/...2.Minimum Operations to Make Binary Array Elements Equal to One II/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3192.Minimum%20Operations%20to%20Make%20Binary%20Array%20Elements%20Equal%20to%20One%20II/README_EN.md
+rating: 1432
+source: Biweekly Contest 133 Q3
 tags:
     - Greedy
     - Array

diff --git a/solution/3100-3199/3193.Count the Number of Inversions/README.md b/solution/3100-3199/3193.Count the Number of Inversions/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3193.Count%20the%20Number%20of%20Inversions/README.md
+rating: 2266
+source: 第 133 场双周赛 Q4
 tags:
     - 数组
     - 动态规划

diff --git a/solution/3100-3199/3193.Count the Number of Inversions/README_EN.md b/solution/3100-3199/3193.Count the Number of Inversions/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3193.Count%20the%20Number%20of%20Inversions/README_EN.md
+rating: 2266
+source: Biweekly Contest 133 Q4
 tags:
     - Array
     - Dynamic Programming

diff --git a/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README.md b/solution/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3194.Minimum%20Average%20of%20Smallest%20and%20Largest%20Elements/README.md
+rating: 1194
+source: 第 403 场周赛 Q1
 tags:
     - 数组
     - 双指针

diff --git a/...on/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README_EN.md b/...on/3100-3199/3194.Minimum Average of Smallest and Largest Elements/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3194.Minimum%20Average%20of%20Smallest%20and%20Largest%20Elements/README_EN.md
+rating: 1194
+source: Weekly Contest 403 Q1
 tags:
     - Array
     - Two Pointers

diff --git a/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README.md b/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3195.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20I/README.md
+rating: 1348
+source: 第 403 场周赛 Q2
 tags:
     - 数组
     - 矩阵

diff --git a/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README_EN.md b/solution/3100-3199/3195.Find the Minimum Area to Cover All Ones I/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3195.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20I/README_EN.md
+rating: 1348
+source: Weekly Contest 403 Q2
 tags:
     - Array
     - Matrix

diff --git a/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README.md b/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3196.Maximize%20Total%20Cost%20of%20Alternating%20Subarrays/README.md
+rating: 1846
+source: 第 403 场周赛 Q3
 tags:
     - 数组
     - 动态规划

diff --git a/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README_EN.md b/solution/3100-3199/3196.Maximize Total Cost of Alternating Subarrays/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3196.Maximize%20Total%20Cost%20of%20Alternating%20Subarrays/README_EN.md
+rating: 1846
+source: Weekly Contest 403 Q3
 tags:
     - Array
     - Dynamic Programming

diff --git a/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README.md b/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3197.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20II/README.md
+rating: 2540
+source: 第 403 场周赛 Q4
 tags:
     - 数组
     - 枚举

diff --git a/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README_EN.md b/solution/3100-3199/3197.Find the Minimum Area to Cover All Ones II/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3100-3199/3197.Find%20the%20Minimum%20Area%20to%20Cover%20All%20Ones%20II/README_EN.md
+rating: 2540
+source: Weekly Contest 403 Q4
 tags:
     - Array
     - Enumeration

diff --git a/solution/3200-3299/3200.Maximum Height of a Triangle/README.md b/solution/3200-3299/3200.Maximum Height of a Triangle/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3200.Maximum%20Height%20of%20a%20Triangle/README.md
+rating: 1451
+source: 第 404 场周赛 Q1
 tags:
     - 数组
     - 枚举

diff --git a/solution/3200-3299/3200.Maximum Height of a Triangle/README_EN.md b/solution/3200-3299/3200.Maximum Height of a Triangle/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3200.Maximum%20Height%20of%20a%20Triangle/README_EN.md
+rating: 1451
+source: Weekly Contest 404 Q1
 tags:
     - Array
     - Enumeration

diff --git a/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README.md b/solution/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3201.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20I/README.md
+rating: 1663
+source: 第 404 场周赛 Q2
 tags:
     - 数组
     - 动态规划

diff --git a/...tion/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README_EN.md b/...tion/3200-3299/3201.Find the Maximum Length of Valid Subsequence I/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3201.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20I/README_EN.md
+rating: 1663
+source: Weekly Contest 404 Q2
 tags:
     - Array
     - Dynamic Programming

diff --git a/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README.md b/solution/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3202.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20II/README.md
+rating: 1973
+source: 第 404 场周赛 Q3
 tags:
     - 数组
     - 动态规划

diff --git a/...ion/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README_EN.md b/...ion/3200-3299/3202.Find the Maximum Length of Valid Subsequence II/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3202.Find%20the%20Maximum%20Length%20of%20Valid%20Subsequence%20II/README_EN.md
+rating: 1973
+source: Weekly Contest 404 Q3
 tags:
     - Array
     - Dynamic Programming

diff --git a/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README.md b/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3203.Find%20Minimum%20Diameter%20After%20Merging%20Two%20Trees/README.md
+rating: 2266
+source: 第 404 场周赛 Q4
 tags:
     - 树
     - 深度优先搜索

diff --git a/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README_EN.md b/solution/3200-3299/3203.Find Minimum Diameter After Merging Two Trees/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3203.Find%20Minimum%20Diameter%20After%20Merging%20Two%20Trees/README_EN.md
+rating: 2266
+source: Weekly Contest 404 Q4
 tags:
     - Tree
     - Depth-First Search