Skip to content

feat: update lc problems #3643

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Oct 16, 2024
Merged

feat: update lc problems #3643

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
dceddc3
feat: update lc problems
yanglbme Oct 16, 2024
a6303e3
fix: update
yanglbme Oct 16, 2024
f5db6b9
Optimised images with calibre/image-actions
idoocs Oct 16, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions solution/3300-3399/3300.Minimum Element After Replacement With Digit Sum/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3300.Minimum%20Element%20After%20Replacement%20With%20Digit%20Sum/README.md
rating: 1181
source: 第 140 场双周赛 Q1
tags:
- 数组
- 数学
Expand Down
2 changes: 2 additions & 0 deletions ...on/3300-3399/3300.Minimum Element After Replacement With Digit Sum/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Easy
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3300.Minimum%20Element%20After%20Replacement%20With%20Digit%20Sum/README_EN.md
rating: 1181
source: Biweekly Contest 140 Q1
tags:
- Array
- Math
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3301.Maximize the Total Height of Unique Towers/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3301.Maximize%20the%20Total%20Height%20of%20Unique%20Towers/README.md
rating: 1448
source: 第 140 场双周赛 Q2
tags:
- 贪心
- 数组
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3301.Maximize the Total Height of Unique Towers/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3301.Maximize%20the%20Total%20Height%20of%20Unique%20Towers/README_EN.md
rating: 1448
source: Biweekly Contest 140 Q2
tags:
- Greedy
- Array
Expand Down
2 changes: 2 additions & 0 deletions ...ion/3300-3399/3302.Find the Lexicographically Smallest Valid Sequence/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3302.Find%20the%20Lexicographically%20Smallest%20Valid%20Sequence/README.md
rating: 2473
source: 第 140 场双周赛 Q3
tags:
- 贪心
- 双指针
Expand Down
2 changes: 2 additions & 0 deletions .../3300-3399/3302.Find the Lexicographically Smallest Valid Sequence/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3302.Find%20the%20Lexicographically%20Smallest%20Valid%20Sequence/README_EN.md
rating: 2473
source: Biweekly Contest 140 Q3
tags:
- Greedy
- Two Pointers
Expand Down
2 changes: 2 additions & 0 deletions ...on/3300-3399/3303.Find the Occurrence of First Almost Equal Substring/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3303.Find%20the%20Occurrence%20of%20First%20Almost%20Equal%20Substring/README.md
rating: 2509
source: 第 140 场双周赛 Q4
tags:
- 字符串
- 字符串匹配
Expand Down
2 changes: 2 additions & 0 deletions ...3300-3399/3303.Find the Occurrence of First Almost Equal Substring/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3303.Find%20the%20Occurrence%20of%20First%20Almost%20Equal%20Substring/README_EN.md
rating: 2509
source: Biweekly Contest 140 Q4
tags:
- String
- String Matching
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3304.Find the K-th Character in String Game I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3304.Find%20the%20K-th%20Character%20in%20String%20Game%20I/README.md
rating: 1288
source: 第 417 场周赛 Q1
tags:
- 位运算
- 递归
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3304.Find the K-th Character in String Game I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Easy
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3304.Find%20the%20K-th%20Character%20in%20String%20Game%20I/README_EN.md
rating: 1288
source: Weekly Contest 417 Q1
tags:
- Bit Manipulation
- Recursion
Expand Down
2 changes: 2 additions & 0 deletions ...99/3305.Count of Substrings Containing Every Vowel and K Consonants I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3305.Count%20of%20Substrings%20Containing%20Every%20Vowel%20and%20K%20Consonants%20I/README.md
rating: 1563
source: 第 417 场周赛 Q2
tags:
- 哈希表
- 字符串
Expand Down
2 changes: 2 additions & 0 deletions ...3305.Count of Substrings Containing Every Vowel and K Consonants I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3305.Count%20of%20Substrings%20Containing%20Every%20Vowel%20and%20K%20Consonants%20I/README_EN.md
rating: 1563
source: Weekly Contest 417 Q2
tags:
- Hash Table
- String
Expand Down
2 changes: 2 additions & 0 deletions ...9/3306.Count of Substrings Containing Every Vowel and K Consonants II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3306.Count%20of%20Substrings%20Containing%20Every%20Vowel%20and%20K%20Consonants%20II/README.md
rating: 2200
source: 第 417 场周赛 Q3
tags:
- 哈希表
- 字符串
Expand Down
2 changes: 2 additions & 0 deletions ...306.Count of Substrings Containing Every Vowel and K Consonants II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3306.Count%20of%20Substrings%20Containing%20Every%20Vowel%20and%20K%20Consonants%20II/README_EN.md
rating: 2200
source: Weekly Contest 417 Q3
tags:
- Hash Table
- String
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3307.Find the K-th Character in String Game II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3307.Find%20the%20K-th%20Character%20in%20String%20Game%20II/README.md
rating: 2232
source: 第 417 场周赛 Q4
tags:
- 位运算
- 递归
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3307.Find the K-th Character in String Game II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3307.Find%20the%20K-th%20Character%20in%20String%20Game%20II/README_EN.md
rating: 2232
source: Weekly Contest 417 Q4
tags:
- Bit Manipulation
- Recursion
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3309.Maximum Possible Number by Binary Concatenation/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3309.Maximum%20Possible%20Number%20by%20Binary%20Concatenation/README.md
rating: 1363
source: 第 418 场周赛 Q1
tags:
- 位运算
- 数组
Expand Down
2 changes: 2 additions & 0 deletions ...ion/3300-3399/3309.Maximum Possible Number by Binary Concatenation/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3309.Maximum%20Possible%20Number%20by%20Binary%20Concatenation/README_EN.md
rating: 1363
source: Weekly Contest 418 Q1
tags:
- Bit Manipulation
- Array
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3310.Remove Methods From Project/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3310.Remove%20Methods%20From%20Project/README.md
rating: 1710
source: 第 418 场周赛 Q2
tags:
- 深度优先搜索
- 广度优先搜索
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3310.Remove Methods From Project/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3310.Remove%20Methods%20From%20Project/README_EN.md
rating: 1710
source: Weekly Contest 418 Q2
tags:
- Depth-First Search
- Breadth-First Search
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3311.Construct 2D Grid Matching Graph Layout/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3311.Construct%202D%20Grid%20Matching%20Graph%20Layout/README.md
rating: 2664
source: 第 418 场周赛 Q3
tags:
- 图
- 数组
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3311.Construct 2D Grid Matching Graph Layout/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3311.Construct%202D%20Grid%20Matching%20Graph%20Layout/README_EN.md
rating: 2664
source: Weekly Contest 418 Q3
tags:
- Graph
- Array
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3312.Sorted GCD Pair Queries/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3312.Sorted%20GCD%20Pair%20Queries/README.md
rating: 2532
source: 第 418 场周赛 Q4
tags:
- 数组
- 哈希表
Expand Down
2 changes: 2 additions & 0 deletions solution/3300-3399/3312.Sorted GCD Pair Queries/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3312.Sorted%20GCD%20Pair%20Queries/README_EN.md
rating: 2532
source: Weekly Contest 418 Q4
tags:
- Array
- Hash Table
Expand Down
3 changes: 3 additions & 0 deletions solution/3300-3399/3314.Construct the Minimum Bitwise Array I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,9 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3314.Construct%20the%20Minimum%20Bitwise%20Array%20I/README.md
tags:
- 位运算
- 数组
---

<!-- problem:start -->
Expand Down
3 changes: 3 additions & 0 deletions solution/3300-3399/3314.Construct the Minimum Bitwise Array I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,9 @@
comments: true
difficulty: Easy
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3314.Construct%20the%20Minimum%20Bitwise%20Array%20I/README_EN.md
tags:
- Bit Manipulation
- Array
---

<!-- problem:start -->
Expand Down
3 changes: 3 additions & 0 deletions solution/3300-3399/3315.Construct the Minimum Bitwise Array II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,9 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3315.Construct%20the%20Minimum%20Bitwise%20Array%20II/README.md
tags:
- 位运算
- 数组
---

<!-- problem:start -->
Expand Down
3 changes: 3 additions & 0 deletions solution/3300-3399/3315.Construct the Minimum Bitwise Array II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,9 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3315.Construct%20the%20Minimum%20Bitwise%20Array%20II/README_EN.md
tags:
- Bit Manipulation
- Array
---

<!-- problem:start -->
Expand Down
6 changes: 6 additions & 0 deletions solution/3300-3399/3316.Find Maximum Removals From Source String/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3316.Find%20Maximum%20Removals%20From%20Source%20String/README.md
tags:
- 数组
- 哈希表
- 双指针
- 字符串
- 动态规划
---

<!-- problem:start -->
Expand Down
6 changes: 6 additions & 0 deletions solution/3300-3399/3316.Find Maximum Removals From Source String/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3316.Find%20Maximum%20Removals%20From%20Source%20String/README_EN.md
tags:
- Array
- Hash Table
- Two Pointers
- String
- Dynamic Programming
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3300-3399/3317.Find the Number of Possible Ways for an Event/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3317.Find%20the%20Number%20of%20Possible%20Ways%20for%20an%20Event/README.md
tags:
- 数学
- 动态规划
- 组合数学
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3300-3399/3317.Find the Number of Possible Ways for an Event/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3317.Find%20the%20Number%20of%20Possible%20Ways%20for%20an%20Event/README_EN.md
tags:
- Math
- Dynamic Programming
- Combinatorics
---

<!-- problem:start -->
Expand Down
5 changes: 5 additions & 0 deletions solution/3300-3399/3318.Find X-Sum of All K-Long Subarrays I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3318.Find%20X-Sum%20of%20All%20K-Long%20Subarrays%20I/README.md
tags:
- 数组
- 哈希表
- 滑动窗口
- 堆（优先队列）
---

<!-- problem:start -->
Expand Down
5 changes: 5 additions & 0 deletions solution/3300-3399/3318.Find X-Sum of All K-Long Subarrays I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: Easy
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3318.Find%20X-Sum%20of%20All%20K-Long%20Subarrays%20I/README_EN.md
tags:
- Array
- Hash Table
- Sliding Window
- Heap (Priority Queue)
---

<!-- problem:start -->
Expand Down
17 changes: 11 additions & 6 deletions solution/3300-3399/3319.K-th Largest Perfect Subtree Size in Binary Tree/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/README.md
tags:
- 树
- 深度优先搜索
- 二叉树
- 排序
---

<!-- problem:start -->
Expand Down Expand Up @@ -33,9 +38,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-

<p><strong>解释：</strong></p>

<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/image.jpg" style="width: 300px; height: 175px;" /></p>
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/tmpresl95rp-1.png" style="width: 400px; height: 173px;" /></p>

<p>完美二叉子树的根节点在图中以黑色突出显示。它们的大小按降序排列为 <code>[3, 3, 1, 1, 1, 1, 1, 1]</code>。<br />
<p>完美二叉子树的根节点在图中以黑色突出显示。它们的大小按非递增顺序排列为 <code>[3, 3, 1, 1, 1, 1, 1, 1]</code>。<br />
第 <code>2</code> 大的完美二叉子树的大小是 3。</p>
</div>

Expand All @@ -48,9 +53,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-

<p><strong>解释：</strong></p>

<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/image1.jpg" style="width: 300px; height: 149px;" /></p>
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/tmp_s508x9e-1.png" style="width: 300px; height: 189px;" /></p>

<p>完美二叉子树的大小按降序排列为 <code>[7, 3, 3, 1, 1, 1, 1]</code>。最大的完美二叉子树的大小是 7。</p>
<p>完美二叉子树的大小按非递增顺序排列为 <code>[7, 3, 3, 1, 1, 1, 1]</code>。最大的完美二叉子树的大小是 7。</p>
</div>

<p><strong class="example">示例 3：</strong></p>
Expand All @@ -62,9 +67,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3319.K-

<p><strong>解释：</strong></p>

<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/image4.jpg" style="width: 150px; height: 130px;" /></p>
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3300-3399/3319.K-th%20Largest%20Perfect%20Subtree%20Size%20in%20Binary%20Tree/images/tmp74xnmpj4-1.png" style="width: 250px; height: 225px;" /></p>

<p>完美二叉子树的大小按降序排列为 <code>[1, 1]</code>。完美二叉子树的数量少于 3。</p>
<p>完美二叉子树的大小按非递增顺序排列为 <code>[1, 1]</code>。完美二叉子树的数量少于 3。</p>
</div>

<p>&nbsp;</p>
Expand Down
Loading
Loading