Skip to content

Commit 683eeef

Browse files
yanglbmeyanglbme
authored
feat: update lc problems (#3686)
1 parent be114e6 commit 683eeef

File tree

20 files changed

+98
-34
lines changed

20 files changed

+98
-34
lines changed

‎solution/0700-0799/0729.My Calendar I/README_EN.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -24,13 +24,13 @@ tags:
2424

2525
<p>A <strong>double booking</strong> happens when two events have some non-empty intersection (i.e., some moment is common to both events.).</p>
2626

27-
<p>The event can be represented as a pair of integers <code>start</code> and <code>end</code> that represents a booking on the half-open interval <code>[start, end)</code>, the range of real numbers <code>x</code> such that <code>start &lt;= x &lt; end</code>.</p>
27+
<p>The event can be represented as a pair of integers <code>startTime</code> and <code>endTime</code> that represents a booking on the half-open interval <code>[startTime, endTime)</code>, the range of real numbers <code>x</code> such that <code>startTime &lt;= x &lt; endTime</code>.</p>
2828

2929
<p>Implement the <code>MyCalendar</code> class:</p>
3030

3131
<ul>
3232
<li><code>MyCalendar()</code> Initializes the calendar object.</li>
33-
<li><code>boolean book(int start, int end)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>double booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
33+
<li><code>boolean book(int startTime, int endTime)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>double booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
3434
</ul>
3535

3636
<p>&nbsp;</p>

‎solution/0700-0799/0731.My Calendar II/README_EN.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -25,13 +25,13 @@ tags:
2525

2626
<p>A <strong>triple booking</strong> happens when three events have some non-empty intersection (i.e., some moment is common to all the three events.).</p>
2727

28-
<p>The event can be represented as a pair of integers <code>start</code> and <code>end</code> that represents a booking on the half-open interval <code>[start, end)</code>, the range of real numbers <code>x</code> such that <code>start &lt;= x &lt; end</code>.</p>
28+
<p>The event can be represented as a pair of integers <code>startTime</code> and <code>endTime</code> that represents a booking on the half-open interval <code>[startTime, endTime)</code>, the range of real numbers <code>x</code> such that <code>startTime &lt;= x &lt; endTime</code>.</p>
2929

3030
<p>Implement the <code>MyCalendarTwo</code> class:</p>
3131

3232
<ul>
3333
<li><code>MyCalendarTwo()</code> Initializes the calendar object.</li>
34-
<li><code>boolean book(int start, int end)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>triple booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
34+
<li><code>boolean book(int startTime, int endTime)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>triple booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
3535
</ul>
3636

3737
<p>&nbsp;</p>

‎solution/3300-3399/3330.Find the Original Typed String I/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README.md
5+
tags:
6+
- 字符串
57
---
68

79
<!-- problem:start -->

‎solution/3300-3399/3330.Find the Original Typed String I/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README_EN.md
5+
tags:
6+
- String
57
---
68

79
<!-- problem:start -->

‎solution/3300-3399/3331.Find Subtree Sizes After Changes/README.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README.md
5+
tags:
6+
- 树
7+
- 深度优先搜索
8+
- 数组
9+
- 哈希表
10+
- 字符串
511
---
612

713
<!-- problem:start -->

‎solution/3300-3399/3331.Find Subtree Sizes After Changes/README_EN.md

+7-3
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README_EN.md
5+
tags:
6+
- Tree
7+
- Depth-First Search
8+
- Array
9+
- Hash Table
10+
- String
511
---
612

713
<!-- problem:start -->
@@ -26,9 +32,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3331.Fi
2632
<li>Otherwise, <strong>remove</strong> the edge between <code>x</code> and its current parent and make node <code>y</code> the new parent of <code>x</code> by adding an edge between them.</li>
2733
</ul>
2834

29-
<p>Return an array <code>answer</code> of size <code>n</code> where <code>answer[i]</code> is the <strong>size</strong> of the subtree rooted at node <code>i</code> in the <strong>final</strong> tree.</p>
30-
31-
<p>A <strong>subtree</strong> of <code>treeName</code> is a tree consisting of a node in <code>treeName</code> and all of its descendants.</p>
35+
<p>Return an array <code>answer</code> of size <code>n</code> where <code>answer[i]</code> is the <strong>size</strong> of the <span data-keyword="subtree">subtree</span> rooted at node <code>i</code> in the <strong>final</strong> tree.</p>
3236

3337
<p>&nbsp;</p>
3438
<p><strong class="example">Example 1:</strong></p>

‎solution/3300-3399/3332.Maximum Points Tourist Can Earn/README.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README.md
5+
tags:
6+
- 数组
7+
- 动态规划
8+
- 矩阵
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3332.Maximum Points Tourist Can Earn/README_EN.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README_EN.md
5+
tags:
6+
- Array
7+
- Dynamic Programming
8+
- Matrix
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3333.Find the Original Typed String II/README.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README.md
5+
tags:
6+
- 字符串
7+
- 动态规划
8+
- 前缀和
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3333.Find the Original Typed String II/README_EN.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README_EN.md
5+
tags:
6+
- String
7+
- Dynamic Programming
8+
- Prefix Sum
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3334.Find the Maximum Factor Score of Array/README.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README.md
5+
tags:
6+
- 数组
7+
- 数学
8+
- 数论
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3334.Find the Maximum Factor Score of Array/README_EN.md

+5-5
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README_EN.md
5+
tags:
6+
- Array
7+
- Math
8+
- Number Theory
59
---
610

711
<!-- problem:start -->
@@ -20,11 +24,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3334.Fi
2024

2125
<p>Return the <strong>maximum factor score</strong> of <code>nums</code> after removing <strong>at most</strong> one element from it.</p>
2226

23-
<p><strong>Note</strong> that <em>both</em> the LCM and GCD of a single number are the number itself, and the <em>factor score</em> of an <strong>empty</strong> array is 0.</p>
24-
25-
<p>The term <code>lcm(a, b)</code> denotes the <strong>least common multiple</strong> of <code>a</code> and <code>b</code>.</p>
26-
27-
<p>The term <code>gcd(a, b)</code> denotes the <strong>greatest common divisor</strong> of <code>a</code> and <code>b</code>.</p>
27+
<p><strong>Note</strong> that <em>both</em> the <span data-keyword="lcm-function">LCM</span> and <span data-keyword="gcd-function">GCD</span> of a single number are the number itself, and the <em>factor score</em> of an <strong>empty</strong> array is 0.</p>
2828

2929
<p>&nbsp;</p>
3030
<p><strong class="example">Example 1:</strong></p>

‎solution/3300-3399/3335.Total Characters in String After Transformations I/README.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README.md
5+
tags:
6+
- 哈希表
7+
- 数学
8+
- 字符串
9+
- 动态规划
10+
- 计数
511
---
612

713
<!-- problem:start -->

‎solution/3300-3399/3335.Total Characters in String After Transformations I/README_EN.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README_EN.md
5+
tags:
6+
- Hash Table
7+
- Math
8+
- String
9+
- Dynamic Programming
10+
- Counting
511
---
612

713
<!-- problem:start -->

‎solution/3300-3399/3336.Find the Number of Subsequences With Equal GCD/README.md

+5
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README.md
5+
tags:
6+
- 数组
7+
- 数学
8+
- 动态规划
9+
- 数论
510
---
611

712
<!-- problem:start -->

‎solution/3300-3399/3336.Find the Number of Subsequences With Equal GCD/README_EN.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README_EN.md
5+
tags:
6+
- Array
7+
- Math
8+
- Dynamic Programming
9+
- Number Theory
510
---
611

712
<!-- problem:start -->
@@ -16,21 +21,17 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3336.Fi
1621

1722
<p>You are given an integer array <code>nums</code>.</p>
1823

19-
<p>Your task is to find the number of pairs of <strong>non-empty</strong> subsequences <code>(seq1, seq2)</code> of <code>nums</code> that satisfy the following conditions:</p>
24+
<p>Your task is to find the number of pairs of <strong>non-empty</strong> <span data-keyword="subsequence-array">subsequences</span> <code>(seq1, seq2)</code> of <code>nums</code> that satisfy the following conditions:</p>
2025

2126
<ul>
2227
<li>The subsequences <code>seq1</code> and <code>seq2</code> are <strong>disjoint</strong>, meaning <strong>no index</strong> of <code>nums</code> is common between them.</li>
23-
<li>The GCD of the elements of <code>seq1</code> is equal to the GCD of the elements of <code>seq2</code>.</li>
28+
<li>The <span data-keyword="gcd-function">GCD</span> of the elements of <code>seq1</code> is equal to the GCD of the elements of <code>seq2</code>.</li>
2429
</ul>
2530

2631
<p>Return the total number of such pairs.</p>
2732

2833
<p>Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
2934

30-
<p>The term <code>gcd(a, b)</code> denotes the <strong>greatest common divisor</strong> of <code>a</code> and <code>b</code>.</p>
31-
32-
<p>A <strong>subsequence</strong> is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.</p>
33-
3435
<p>&nbsp;</p>
3536
<p><strong class="example">Example 1:</strong></p>
3637

‎solution/3300-3399/3337.Total Characters in String After Transformations II/README.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README.md
5+
tags:
6+
- 哈希表
7+
- 数学
8+
- 字符串
9+
- 动态规划
10+
- 计数
511
---
612

713
<!-- problem:start -->

‎solution/3300-3399/3337.Total Characters in String After Transformations II/README_EN.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README_EN.md
5+
tags:
6+
- Hash Table
7+
- Math
8+
- String
9+
- Dynamic Programming
10+
- Counting
511
---
612

713
<!-- problem:start -->

‎solution/README.md

+8-8
Original file line numberDiff line numberDiff line change
@@ -3340,14 +3340,14 @@
33403340
| 3327 | [判断 DFS 字符串是否是回文串](/solution/3300-3399/3327.Check%20if%20DFS%20Strings%20Are%20Palindromes/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`字符串`,`哈希函数` | 困难 | 第 420 场周赛 |
33413341
| 3328 | [查找每个州的城市 II](/solution/3300-3399/3328.Find%20Cities%20in%20Each%20State%20II/README.md) | `数据库` | 中等 | 🔒 |
33423342
| 3329 | [字符至少出现 K 次的子字符串 II](/solution/3300-3399/3329.Count%20Substrings%20With%20K-Frequency%20Characters%20II/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | 🔒 |
3343-
| 3330 | [找到初始输入字符串 I](/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README.md) | | 简单 | 第 142 场双周赛 |
3344-
| 3331 | [修改后子树的大小](/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README.md) | | 中等 | 第 142 场双周赛 |
3345-
| 3332 | [旅客可以得到的最多点数](/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README.md) | | 中等 | 第 142 场双周赛 |
3346-
| 3333 | [找到初始输入字符串 II](/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README.md) | | 困难 | 第 142 场双周赛 |
3347-
| 3334 | [数组的最大因子得分](/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README.md) | | 中等 | 第 421 场周赛 |
3348-
| 3335 | [字符串转换后的长度 I](/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README.md) | | 中等 | 第 421 场周赛 |
3349-
| 3336 | [最大公约数相等的子序列数量](/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README.md) | | 困难 | 第 421 场周赛 |
3350-
| 3337 | [字符串转换后的长度 II](/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README.md) | | 困难 | 第 421 场周赛 |
3343+
| 3330 | [找到初始输入字符串 I](/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README.md) | `字符串` | 简单 | 第 142 场双周赛 |
3344+
| 3331 | [修改后子树的大小](/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`字符串` | 中等 | 第 142 场双周赛 |
3345+
| 3332 | [旅客可以得到的最多点数](/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 142 场双周赛 |
3346+
| 3333 | [找到初始输入字符串 II](/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README.md) | `字符串`,`动态规划`,`前缀和` | 困难 | 第 142 场双周赛 |
3347+
| 3334 | [数组的最大因子得分](/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README.md) | `数组`,`数学`,`数论` | 中等 | 第 421 场周赛 |
3348+
| 3335 | [字符串转换后的长度 I](/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README.md) | `哈希表`,`数学`,`字符串`,`动态规划`,`计数` | 中等 | 第 421 场周赛 |
3349+
| 3336 | [最大公约数相等的子序列数量](/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README.md) | `数组`,`数学`,`动态规划`,`数论` | 困难 | 第 421 场周赛 |
3350+
| 3337 | [字符串转换后的长度 II](/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README.md) | `哈希表`,`数学`,`字符串`,`动态规划`,`计数` | 困难 | 第 421 场周赛 |
33513351
| 3338 | [Second Highest Salary II](/solution/3300-3399/3338.Second%20Highest%20Salary%20II/README.md) | `数据库` | 中等 | 🔒 |
33523352

33533353
## 版权

‎solution/README_EN.md

+8-8
Original file line numberDiff line numberDiff line change
@@ -3338,14 +3338,14 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
33383338
| 3327 | [Check if DFS Strings Are Palindromes](/solution/3300-3399/3327.Check%20if%20DFS%20Strings%20Are%20Palindromes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`String`,`Hash Function` | Hard | Weekly Contest 420 |
33393339
| 3328 | [Find Cities in Each State II](/solution/3300-3399/3328.Find%20Cities%20in%20Each%20State%20II/README_EN.md) | `Database` | Medium | 🔒 |
33403340
| 3329 | [Count Substrings With K-Frequency Characters II](/solution/3300-3399/3329.Count%20Substrings%20With%20K-Frequency%20Characters%20II/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | 🔒 |
3341-
| 3330 | [Find the Original Typed String I](/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README_EN.md) | | Easy | Biweekly Contest 142 |
3342-
| 3331 | [Find Subtree Sizes After Changes](/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README_EN.md) | | Medium | Biweekly Contest 142 |
3343-
| 3332 | [Maximum Points Tourist Can Earn](/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README_EN.md) | | Medium | Biweekly Contest 142 |
3344-
| 3333 | [Find the Original Typed String II](/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README_EN.md) | | Hard | Biweekly Contest 142 |
3345-
| 3334 | [Find the Maximum Factor Score of Array](/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README_EN.md) | | Medium | Weekly Contest 421 |
3346-
| 3335 | [Total Characters in String After Transformations I](/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README_EN.md) | | Medium | Weekly Contest 421 |
3347-
| 3336 | [Find the Number of Subsequences With Equal GCD](/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README_EN.md) | | Hard | Weekly Contest 421 |
3348-
| 3337 | [Total Characters in String After Transformations II](/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README_EN.md) | | Hard | Weekly Contest 421 |
3341+
| 3330 | [Find the Original Typed String I](/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README_EN.md) | `String` | Easy | Biweekly Contest 142 |
3342+
| 3331 | [Find Subtree Sizes After Changes](/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 142 |
3343+
| 3332 | [Maximum Points Tourist Can Earn](/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 142 |
3344+
| 3333 | [Find the Original Typed String II](/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 142 |
3345+
| 3334 | [Find the Maximum Factor Score of Array](/solution/3300-3399/3334.Find%20the%20Maximum%20Factor%20Score%20of%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 421 |
3346+
| 3335 | [Total Characters in String After Transformations I](/solution/3300-3399/3335.Total%20Characters%20in%20String%20After%20Transformations%20I/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming`,`Counting` | Medium | Weekly Contest 421 |
3347+
| 3336 | [Find the Number of Subsequences With Equal GCD](/solution/3300-3399/3336.Find%20the%20Number%20of%20Subsequences%20With%20Equal%20GCD/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Number Theory` | Hard | Weekly Contest 421 |
3348+
| 3337 | [Total Characters in String After Transformations II](/solution/3300-3399/3337.Total%20Characters%20in%20String%20After%20Transformations%20II/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 421 |
33493349
| 3338 | [Second Highest Salary II](/solution/3300-3399/3338.Second%20Highest%20Salary%20II/README_EN.md) | `Database` | Medium | 🔒 |
33503350

33513351
## Copyright

0 commit comments

Comments
 (0)