Maximize Active Section with Trade I |
Medium
|
|
|
Maximize Amount After Two Days of Conversions |
Medium
|
|
|
Maximize Profit from Task Assignment |
Medium
|
|
|
Maximize Score After Pair Deletions |
Medium
|
|
|
Maximum Amount of Money Robot Can Earn |
Medium
|
|
|
Maximum and Minimum Sums of at Most Size K Subsequences |
Medium
|
|
|
Maximum Area Rectangle With Point Constraints I |
Medium
|
|
|
Maximum Coin Collection |
Medium
|
|
|
Maximum Coins From K Consecutive Bags |
Medium
|
|
|
Maximum Frequency After Subarray Operation |
Medium
|
|
|
Maximum Number of Distinct Elements After Operations |
Medium
|
|
|
Maximum Subarray Sum With Length Divisible by K |
Medium
|
|
|
Maximum Sum With at Most K Elements |
Medium
|
|
|
Maximum Weighted K-Edge Path |
Medium
|
|
|
Minimize the Maximum Edge Weight of Graph |
Medium
|
|
|
Minimum Cost to Make Arrays Identical |
Medium
|
|
|
Minimum Threshold for Inversion Pairs Count |
Medium
|
|
|
Minimum Time to Break Locks I |
Medium
|
|
|
Minimum Time to Visit All Houses |
Medium
|
|
|
Number of Unique XOR Triplets I |
Medium
|
|
|
Number of Unique XOR Triplets II |
Medium
|
|
|
Path Existence Queries in a Graph I |
Medium
|
|
|
Permutations III |
Medium
|
|
|
Separate Squares I |
Medium
|
|
|
Smallest Palindromic Rearrangement I |
Medium
|
|
|
Unit Conversion I |
Medium
|
|
|
Zero Array Transformation IV |
Medium
|
|
|