Directory page 81 of 94
Competitive Programming Solution Directory — Page 81
Browse page 81 of the Magical CP Library A–Z directory: 14,011 competitive programming problems with solutions in the available languages.
Each problem appears once here, with separate language links when multiple implementations are available.
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
Data structures · 3 languages
Maximum Number of Operations to Move Ones to the End
Implementation & simulation · 3 languages
Maximum Number of Operations With the Same Score I
Implementation & simulation · 3 languages
Maximum Number of People That Can Be Caught in Tag
Implementation & simulation · 3 languages
Maximum Number of Removal Queries That Can Be Processed I
Dynamic programming · 3 languages
Maximum Number That Sum of the Prices Is Less Than or Equal to K
Implementation & simulation · 3 languages
Maximum Product of First and Last Elements of a Subsequence
Implementation & simulation · 2 languages
Maximum Product of Subsequences With an Alternating Sum Equal to K
Data structures · 3 languages
Maximum Product of Three Elements After One Replacement
Implementation & simulation · 2 languages
Maximum Profitable Triplets With Increasing Prices I
Implementation & simulation · 3 languages
Maximum Profitable Triplets With Increasing Prices II
Implementation & simulation · 3 languages
Maximum Score from Performing Multiplication Operations
Implementation & simulation · 3 languages
Maximum Side Length of a Square with Sum Less than or Equal to Threshold
Arrays & prefix sums · 3 languages
Maximum Sum of Alternating Subsequence with Distance at Least K
Dynamic programming · 2 languages