| 914 | X of a Kind in a Deck of Cards | Easy |
| 1201 | Ugly Number III | Medium |
| 1250 | Check If It Is a Good Array | Hard |
| 1447 | Simplified Fractions | Medium |
| 1735 | Count Ways to Make Array With Product | Hard |
| 1799 | Maximize Score After N Operations | Hard |
| 1819 | Number of Different Subsequences GCDs | Hard |
| 1979 | Find Greatest Common Divisor of Array | Easy |
| 2001 | Number of Pairs of Interchangeable Rectangles | Medium |
| 2183 | Count Array Pairs Divisible by K | Hard |
| 2197 | Replace Non-Coprime Numbers in Array | Hard |
| 2280 | Minimum Lines to Represent a Line Chart | Medium |
| 2338 | Count the Number of Ideal Arrays | Hard |
| 2344 | Minimum Deletions to Make Array Divisible | Hard |
| 2447 | Number of Subarrays With GCD Equal to K | Medium |
| 2470 | Number of Subarrays With LCM Equal to K | Medium |
| 2507 | Smallest Value After Replacing With Sum of Prime Factors | Medium |
| 2523 | Closest Prime Numbers in Range | Medium |
| 2543 | Check if Point Is Reachable | Hard |
| 2584 | Split the Array to Make Coprime Products | Hard |
| 2601 | Prime Subtraction Operation | Medium |
| 2607 | Make K-Subarray Sums Equal | Medium |
| 2614 | Prime In Diagonal | Easy |
| 2652 | Sum Multiples | Easy |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium |
| 2709 | Greatest Common Divisor Traversal | Hard |
| 2748 | Number of Beautiful Pairs | Easy |
| 2761 | Prime Pairs With Target Sum | Medium |
| 2818 | Apply Operations to Maximize Score | Hard |