Directory page 71 of 94
Competitive Programming Solution Directory — Page 71
Browse page 71 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.
LeetCode
Count Non-Decreasing Subarrays After K Operations
Implementation & simulation · 3 languages
LeetCode
Count of Substrings Containing Every Vowel and K Consonants I
Data structures · 3 languages
LeetCode
Count of Substrings Containing Every Vowel and K Consonants II
Data structures · 3 languages
LeetCode
Count Pairs of Equal Substrings With Minimum Difference
Implementation & simulation · 3 languages
LeetCode
Count Positions on Street With Required Brightness
Implementation & simulation · 3 languages
LeetCode
Count Subarrays Where Max Element Appears at Least K Times
Arrays & prefix sums · 3 languages
LeetCode
Count Subarrays with Cost Less Than or Equal to K
Implementation & simulation · 2 languages
LeetCode
Count Submatrices with Top-Left Element and Sum Less Than k
Arrays & prefix sums · 3 languages
LeetCode
Count Substrings Starting and Ending with Given Character
Implementation & simulation · 3 languages
LeetCode
Count the Number of Houses at a Certain Distance I
Implementation & simulation · 3 languages
LeetCode
Count the Number of Houses at a Certain Distance II
Implementation & simulation · 3 languages
LeetCode
Count the Number of Substrings With Dominant Ones
Implementation & simulation · 3 languages