Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit ee147f7

Browse files
feat: add new lc problems (#4668)
1 parent 4bc957d commit ee147f7

File tree

58 files changed

+668
-94
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

58 files changed

+668
-94
lines changed

‎solution/3600-3699/3613.Minimize Maximum Component Cost/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,10 +5,10 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3613.Mi
55
rating: 1641
66
source: 第 458 场周赛 Q2
77
tags:
8-
- 排序
98
- 并查集
109
- 图
1110
- 二分查找
11+
- 排序
1212
---
1313

1414
<!-- problem:start -->

‎solution/3600-3699/3613.Minimize Maximum Component Cost/README_EN.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,10 +5,10 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3613.Mi
55
rating: 1641
66
source: Weekly Contest 458 Q2
77
tags:
8-
- Sort
98
- Union Find
109
- Graph
1110
- Binary Search
11+
- Sorting
1212
---
1313

1414
<!-- problem:start -->

‎solution/3600-3699/3624.Number of Integers With Popcount-Depth Equal to K II/README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3624.Nu
55
rating: 2085
66
source: 第 459 场周赛 Q3
77
tags:
8+
- 树状数组
89
- 线段树
910
- 数组
1011
- 分治

‎solution/3600-3699/3624.Number of Integers With Popcount-Depth Equal to K II/README_EN.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3624.Nu
55
rating: 2085
66
source: Weekly Contest 459 Q3
77
tags:
8+
- Binary Indexed Tree
89
- Segment Tree
910
- Array
1011
- Divide and Conquer

‎solution/3600-3699/3628.Maximum Number of Subsequences After One Inserting/README.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,11 @@ difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3628.Maximum%20Number%20of%20Subsequences%20After%20One%20Inserting/README.md
55
rating: 1753
66
source: 第 460 场周赛 Q2
7+
tags:
8+
- 贪心
9+
- 字符串
10+
- 动态规划
11+
- 前缀和
712
---
813

914
<!-- problem:start -->

‎solution/3600-3699/3628.Maximum Number of Subsequences After One Inserting/README_EN.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,11 @@ difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3628.Maximum%20Number%20of%20Subsequences%20After%20One%20Inserting/README_EN.md
55
rating: 1753
66
source: Weekly Contest 460 Q2
7+
tags:
8+
- Greedy
9+
- String
10+
- Dynamic Programming
11+
- Prefix Sum
712
---
813

914
<!-- problem:start -->

‎solution/3600-3699/3629.Minimum Jumps to Reach End via Prime Teleportation/README.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,12 @@ difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3629.Minimum%20Jumps%20to%20Reach%20End%20via%20Prime%20Teleportation/README.md
55
rating: 2139
66
source: 第 460 场周赛 Q3
7+
tags:
8+
- 广度优先搜索
9+
- 数组
10+
- 哈希表
11+
- 数学
12+
- 数论
713
---
814

915
<!-- problem:start -->

‎solution/3600-3699/3629.Minimum Jumps to Reach End via Prime Teleportation/README_EN.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,12 @@ difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3629.Minimum%20Jumps%20to%20Reach%20End%20via%20Prime%20Teleportation/README_EN.md
55
rating: 2139
66
source: Weekly Contest 460 Q3
7+
tags:
8+
- Breadth-First Search
9+
- Array
10+
- Hash Table
11+
- Math
12+
- Number Theory
713
---
814

915
<!-- problem:start -->

‎solution/3600-3699/3630.Partition Array for Maximum XOR and AND/README.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,11 @@ difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3630.Partition%20Array%20for%20Maximum%20XOR%20and%20AND/README.md
55
rating: 2743
66
source: 第 460 场周赛 Q4
7+
tags:
8+
- 贪心
9+
- 数组
10+
- 数学
11+
- 枚举
712
---
813

914
<!-- problem:start -->

‎solution/3600-3699/3630.Partition Array for Maximum XOR and AND/README_EN.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,11 @@ difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3630.Partition%20Array%20for%20Maximum%20XOR%20and%20AND/README_EN.md
55
rating: 2743
66
source: Weekly Contest 460 Q4
7+
tags:
8+
- Greedy
9+
- Array
10+
- Math
11+
- Enumeration
712
---
813

914
<!-- problem:start -->

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /