2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3455 | Shortest Matching Substring | Hard |
| 3456 | Find Special Substring of Length K | Easy |
| 3457 | Eat Pizzas! |
Page 56 of 59
| Medium |
| 3458 | Select K Disjoint Special Substrings | Medium |
| 3459 | Length of Longest V-Shaped Diagonal Segment | Hard |
| 3461 | Check If Digits Are Equal in String After Operations I | Easy |
| 3462 | Maximum Sum With at Most K Elements | Medium |
| 3463 | Check If Digits Are Equal in String After Operations II | Hard |
| 3464 | Maximize the Distance Between Points on a Square | Hard |
| 3465 | Find Products with Valid Serial Numbers | Easy |
| 3467 | Transform Array by Parity | Easy |
| 3468 | Find the Number of Copy Arrays | Medium |
| 3469 | Find Minimum Cost to Remove Array Elements | Medium |
| 3470 | Permutations IV | Hard |
| 3471 | Find the Largest Almost Missing Integer | Easy |
| 3472 | Longest Palindromic Subsequence After at Most K Operations | Medium |
| 3473 | Sum of K Subarrays With Length at Least M | Medium |
| 3474 | Lexicographically Smallest Generated String | Hard |
| 3475 | DNA Pattern Recognition | Medium |
| 3477 | Fruits Into Baskets II | Easy |
| 3478 | Choose K Elements With Maximum Sum | Medium |
| 3479 | Fruits Into Baskets III | Medium |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard |
| 3482 | Analyze Organization Hierarchy | Hard |
| 3483 | Unique 3-Digit Even Numbers | Easy |
| 3484 | Design Spreadsheet | Medium |
| 3485 | Longest Common Prefix of K Strings After Removal | Hard |
| 3486 | Longest Special Path II | Hard |
| 3487 | Maximum Unique Subarray Sum After Deletion | Easy |
| 3488 | Closest Equal Element Queries | Medium |
| 3489 | Zero Array Transformation IV | Medium |
| 3490 | Count Beautiful Numbers | Hard |
| 3492 | Maximum Containers on a Ship | Easy |
| 3493 | Properties Graph | Medium |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Medium |
| 3495 | Minimum Operations to Make Array Elements Zero | Hard |
| 3497 | Analyze Subscription Conversion | Medium |
| 3498 | Reverse Degree of a String | Easy |
| 3499 | Maximize Active Section with Trade I | Medium |
| 3500 | Minimum Cost to Divide Array Into Subarrays | Hard |
| 3501 | Maximize Active Section with Trade II | Hard |
| 3502 | Minimum Cost to Reach Every Position | Easy |
| 3503 | Longest Palindrome After Substring Concatenation I | Medium |
| 3504 | Longest Palindrome After Substring Concatenation II | Hard |
| 3505 | Minimum Operations to Make Elements Within K Subarrays Equal | Hard |
| 3507 | Minimum Pair Removal to Sort Array I | Easy |
| 3508 | Implement Router | Medium |
| 3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | Hard |
| 3510 | Minimum Pair Removal to Sort Array II | Hard |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | Easy |
© 2026 PhantomCodeAI. All rights reserved.