Partitioning Greedy¶
Table of Contents¶
- 1221. Split a String in Balanced Strings (Easy)
- 2405. Optimal Partition of String (Medium)
- 2294. Partition Array Such That Maximum Difference Is K (Medium)
- 2358. Maximum Number of Groups Entering a Competition (Medium)
- 2522. Partition String Into Substrings With Values at Most K (Medium)
- 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target (Medium)
- 2436. Minimum Split Into Subarrays With GCD Greater Than One (Medium) 👑
- 2892. Minimizing Array After Replacing Pairs With Their Product (Medium) 👑
1221. Split a String in Balanced Strings¶
-
LeetCode | LeetCode CH (Easy)
-
Tags: string, greedy, counting
2405. Optimal Partition of String¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: hash table, string, greedy
2294. Partition Array Such That Maximum Difference Is K¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, greedy, sorting
2358. Maximum Number of Groups Entering a Competition¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, binary search, greedy
2522. Partition String Into Substrings With Values at Most K¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: string, dynamic programming, greedy
1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, greedy, prefix sum
2436. Minimum Split Into Subarrays With GCD Greater Than One¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, dynamic programming, greedy, number theory
2892. Minimizing Array After Replacing Pairs With Their Product¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, greedy