1,464 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3218 | Minimum Cost for Cutting Cake I | Medium |
| 3220 | Odd and Even Transactions | Medium |
| 3223 | Minimum Length of String After Operations |
Page 27 of 30
| Medium |
| 3224 | Minimum Array Changes to Make Differences Equal | Medium |
| 3227 | Vowels Game in a String | Medium |
| 3228 | Maximum Number of Operations to Move Ones to the End | Medium |
| 3233 | Find the Count of Numbers Which Are Not Special | Medium |
| 3234 | Count the Number of Substrings With Dominant Ones | Medium |
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | Medium |
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | Medium |
| 3243 | Shortest Distance After Road Addition Queries I | Medium |
| 3249 | Count the Number of Good Nodes | Medium |
| 3254 | Find the Power of K-Size Subarrays I | Medium |
| 3255 | Find the Power of K-Size Subarrays II | Medium |
| 3259 | Maximum Energy Boost From Two Drinks | Medium |
| 3265 | Count Almost Equal Pairs I | Medium |
| 3271 | Hash Divided String | Medium |
| 3275 | K-th Nearest Obstacle Queries | Medium |
| 3281 | Maximize Score of Numbers in Ranges | Medium |
| 3282 | Reach End of Array With Max Score | Medium |
| 3286 | Find a Safe Walk Through a Grid | Medium |
| 3290 | Maximum Multiplication Score | Medium |
| 3291 | Minimum Number of Valid Strings to Form Target I | Medium |
| 3295 | Report Spam Message | Medium |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | Medium |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | Medium |
| 3301 | Maximize the Total Height of Unique Towers | Medium |
| 3302 | Find the Lexicographically Smallest Valid Sequence | Medium |
| 3305 | Count of Substrings Containing Every Vowel and K Consonants I | Medium |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium |
| 3309 | Maximum Possible Number by Binary Concatenation | Medium |
| 3310 | Remove Methods From Project | Medium |
| 3315 | Construct the Minimum Bitwise Array II | Medium |
| 3316 | Find Maximum Removals From Source String | Medium |
| 3319 | K-th Largest Perfect Subtree Size in Binary Tree | Medium |
| 3324 | Find the Sequence of Strings Appeared on the Screen | Medium |
| 3325 | Count Substrings With K-Frequency Characters I | Medium |
| 3326 | Minimum Division Operations to Make Array Non Decreasing | Medium |
| 3331 | Find Subtree Sizes After Changes | Medium |
| 3332 | Maximum Points Tourist Can Earn | Medium |
| 3334 | Find the Maximum Factor Score of Array | Medium |
| 3335 | Total Characters in String After Transformations I | Medium |
| 3341 | Find Minimum Time to Reach Last Room I | Medium |
| 3342 | Find Minimum Time to Reach Last Room II | Medium |
| 3346 | Maximum Frequency of an Element After Performing Operations I | Medium |
| 3350 | Adjacent Increasing Subarrays Detection II | Medium |
| 3355 | Zero Array Transformation I | Medium |
| 3356 | Zero Array Transformation II | Medium |
| 3361 | Shift Distance Between Two Strings | Medium |
| 3362 | Zero Array Transformation III | Medium |
© 2026 PhantomCodeAI. All rights reserved.