686 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3343 | Count Number of Balanced Permutations | Hard |
| 3347 | Maximum Frequency of an Element After Performing Operations II | Hard |
| 3348 | Smallest Divisible Digit Product II |
Page 13 of 14
| Hard |
| 3351 | Sum of Good Subsequences | Hard |
| 3352 | Count K-Reducible Numbers Less Than N | Hard |
| 3357 | Minimize the Maximum Adjacent Element Difference | Hard |
| 3363 | Find the Maximum Number of Fruits Collected | Hard |
| 3367 | Maximize Sum of Weights after Edge Removals | Hard |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | Hard |
| 3374 | First Letter Capitalization II | Hard |
| 3378 | Count Connected Components in LCM Graph | Hard |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard |
| 3389 | Minimum Operations to Make Character Frequencies Equal | Hard |
| 3395 | Subsequences with a Unique Middle Mode I | Hard |
| 3398 | Smallest Substring With Identical Characters I | Hard |
| 3399 | Smallest Substring With Identical Characters II | Hard |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | Hard |
| 3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | Hard |
| 3414 | Maximum Score of Non-overlapping Intervals | Hard |
| 3420 | Count Non-Decreasing Subarrays After K Operations | Hard |
| 3425 | Longest Special Path | Hard |
| 3426 | Manhattan Distances of All Arrangements of Pieces | Hard |
| 3430 | Maximum and Minimum Sums of at Most Size K Subarrays | Hard |
| 3435 | Frequencies of Shortest Supersequences | Hard |
| 3441 | Minimum Cost Good Caption | Hard |
| 3444 | Minimum Increments for Target Multiples in an Array | Hard |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Hard |
| 3448 | Count Substrings Divisible By Last Digit | Hard |
| 3449 | Maximize the Minimum Game Score | Hard |
| 3451 | Find Invalid IP Addresses | Hard |
| 3454 | Separate Squares II | Hard |
| 3455 | Shortest Matching Substring | Hard |
| 3459 | Length of Longest V-Shaped Diagonal Segment | Hard |
| 3463 | Check If Digits Are Equal in String After Operations II | Hard |
| 3464 | Maximize the Distance Between Points on a Square | Hard |
| 3470 | Permutations IV | Hard |
| 3474 | Lexicographically Smallest Generated String | Hard |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard |
| 3482 | Analyze Organization Hierarchy | Hard |
| 3485 | Longest Common Prefix of K Strings After Removal | Hard |
| 3486 | Longest Special Path II | Hard |
| 3490 | Count Beautiful Numbers | Hard |
| 3495 | Minimum Operations to Make Array Elements Zero | Hard |
| 3500 | Minimum Cost to Divide Array Into Subarrays | Hard |
| 3501 | Maximize Active Section with Trade II | Hard |
| 3504 | Longest Palindrome After Substring Concatenation II | Hard |
| 3505 | Minimum Operations to Make Elements Within K Subarrays Equal | Hard |
| 3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | Hard |
| 3510 | Minimum Pair Removal to Sort Array II | Hard |
| 3515 | Shortest Path in a Weighted Tree | Hard |
© 2026 PhantomCodeAI. All rights reserved.