2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3333 | Find the Original Typed String II | Hard |
| 3334 | Find the Maximum Factor Score of Array | Medium |
| 3335 | Total Characters in String After Transformations I |
Page 54 of 59
| Medium |
| 3336 | Find the Number of Subsequences With Equal GCD | Hard |
| 3337 | Total Characters in String After Transformations II | Hard |
| 3340 | Check Balanced String | Easy |
| 3341 | Find Minimum Time to Reach Last Room I | Medium |
| 3342 | Find Minimum Time to Reach Last Room II | Medium |
| 3343 | Count Number of Balanced Permutations | Hard |
| 3345 | Smallest Divisible Digit Product I | Easy |
| 3346 | Maximum Frequency of an Element After Performing Operations I | Medium |
| 3347 | Maximum Frequency of an Element After Performing Operations II | Hard |
| 3348 | Smallest Divisible Digit Product II | Hard |
| 3349 | Adjacent Increasing Subarrays Detection I | Easy |
| 3350 | Adjacent Increasing Subarrays Detection II | Medium |
| 3351 | Sum of Good Subsequences | Hard |
| 3352 | Count K-Reducible Numbers Less Than N | Hard |
| 3354 | Make Array Elements Equal to Zero | Easy |
| 3355 | Zero Array Transformation I | Medium |
| 3356 | Zero Array Transformation II | Medium |
| 3357 | Minimize the Maximum Adjacent Element Difference | Hard |
| 3360 | Stone Removal Game | Easy |
| 3361 | Shift Distance Between Two Strings | Medium |
| 3362 | Zero Array Transformation III | Medium |
| 3363 | Find the Maximum Number of Fruits Collected | Hard |
| 3364 | Minimum Positive Sum Subarray | Easy |
| 3365 | Rearrange K Substrings to Form Target String | Medium |
| 3366 | Minimum Array Sum | Medium |
| 3367 | Maximize Sum of Weights after Edge Removals | Hard |
| 3370 | Smallest Number With All Set Bits | Easy |
| 3371 | Identify the Largest Outlier in an Array | Medium |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | Medium |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | Hard |
| 3374 | First Letter Capitalization II | Hard |
| 3375 | Minimum Operations to Make Array Values Equal to K | Easy |
| 3376 | Minimum Time to Break Locks I | Medium |
| 3377 | Digit Operations to Make Two Integers Equal | Medium |
| 3378 | Count Connected Components in LCM Graph | Hard |
| 3379 | Transformed Array | Easy |
| 3380 | Maximum Area Rectangle With Point Constraints I | Medium |
| 3381 | Maximum Subarray Sum With Length Divisible by K | Medium |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard |
| 3386 | Button with Longest Push Time | Easy |
| 3387 | Maximize Amount After Two Days of Conversions | Medium |
| 3388 | Count Beautiful Splits in an Array | Medium |
| 3389 | Minimum Operations to Make Character Frequencies Equal | Hard |
| 3392 | Count Subarrays of Length Three With a Condition | Easy |
| 3393 | Count Paths With the Given XOR Value | Medium |
| 3394 | Check if Grid can be Cut into Sections | Medium |
| 3395 | Subsequences with a Unique Middle Mode I | Hard |
© 2026 PhantomCodeAI. All rights reserved.