| 204 | Count Primes | — | Medium | ArrayMathEnumeration | 35% | |
| 258 | Add Digits | — | Easy | MathSimulationNumber Theory | 68% | |
| 858 | Mirror Reflection | — | Medium | MathGeometryNumber Theory | 62% | |
| 866 | Prime Palindrome | — | Medium | MathNumber Theory | 27% | |
| 914 | X of a Kind in a Deck of Cards | — | Easy | ArrayHash TableMath | 30% | |
| 952 | Largest Component Size by Common Factorread | — | Hard | ArrayHash TableMath | 41% | |
| 1201 | Ugly Number IIIread | — | Medium | MathBinary SearchCombinatorics | 30% | |
| 1250 | Check If It Is a Good Array | — | Hard | ArrayMathNumber Theory | 61% | |
| 1447 | Simplified Fractionsread | — | Medium | MathStringNumber Theory | 68% | |
| 1492 | The kth Factor of nread | — | Medium | MathNumber Theory | 70% | |
| 1627 | Graph Connectivity With Thresholdread | — | Hard | ArrayMathUnion Find | 48% | |
| 1735 | Count Ways to Make Array With Productread | — | Hard | ArrayMathDynamic Programming | 53% | |
| 1766 | Tree of Coprimesread | — | Hard | ArrayMathTree | 42% | |
| 1799 | Maximize Score After N Operationsread | — | Hard | ArrayMathDynamic Programming | 58% | |
| 1808 | Maximize Number of Nice Divisorsread | — | Hard | MathRecursionNumber Theory | 33% | |
| 1819 | Number of Different Subsequences GCDsread | — | Hard | ArrayMathCounting | 42% | |
| 1952 | Three Divisorsread | — | Easy | MathEnumerationNumber Theory | 63% | |
| 1979 | Find Greatest Common Divisor of Arrayread | — | Easy | ArrayMathNumber Theory | 79% | |
| 1998 | GCD Sort of an Arrayread | — | Hard | ArrayMathUnion Find | 46% | |
| 2001 | Number of Pairs of Interchangeable Rectanglesread | — | Medium | ArrayHash TableMath | 51% | |
| 2183 | Count Array Pairs Divisible by Kread | — | Hard | ArrayMathNumber Theory | 30% | |
| 2197 | Replace Non-Coprime Numbers in Array | — | Hard | ArrayMathStack | 40% | |
| 2280 | Minimum Lines to Represent a Line Chartread | — | Medium | ArrayMathGeometry | 26% | |
| 2338 | Count the Number of Ideal Arraysread | — | Hard | MathDynamic ProgrammingCombinatorics | 57% | |
| 2344 | Minimum Deletions to Make Array Divisibleread | — | Hard | ArrayMathSorting | 58% | |
| 2413 | Smallest Even Multipleread | — | Easy | MathNumber Theory | 88% | |
| 2427 | Number of Common Factorsread | — | Easy | MathEnumerationNumber Theory | 79% | |
| 2447 | Number of Subarrays With GCD Equal to K | — | Medium | ArrayMathNumber Theory | 51% | |
| 2470 | Number of Subarrays With LCM Equal to K | — | Medium | ArrayMathNumber Theory | 40% | |
| 2507 | Smallest Value After Replacing With Sum of Prime Factorsread | — | Medium | MathSimulationNumber Theory | 49% | |
| 2513 | Minimize the Maximum of Two Arraysread | — | Medium | MathBinary SearchNumber Theory | 31% | |
| 2521 | Distinct Prime Factors of Product of Arrayread | — | Medium | ArrayHash TableMath | 53% | |
| 2523 | Closest Prime Numbers in Rangeread | — | Medium | MathNumber Theory | 52% | |
| 2543 | Check if Point Is Reachableread | — | Hard | MathNumber Theory | 43% | |
| 2584 | Split the Array to Make Coprime Productsread | — | Hard | ArrayHash TableMath | 28% | |
| 2601 | Prime Subtraction Operationread | — | Medium | ArrayMathBinary Search | 56% | |
| 2607 | Make K-Subarray Sums Equalread | — | Medium | ArrayMathGreedy | 36% | |
| 2614 | Prime In Diagonalread | — | Easy | ArrayMathMatrix | 36% | |
| 2709 | Greatest Common Divisor Traversalread | — | Hard | ArrayMathUnion Find | 42% | |
| 2748 | Number of Beautiful Pairs | — | Easy | ArrayHash TableMath | 51% | |
| 2761 | Prime Pairs With Target Sumread | — | Medium | ArrayMathEnumeration | 35% | |
| 2807 | Insert Greatest Common Divisors in Linked Listread | — | Medium | Linked ListMathNumber Theory | 92% | |
| 2818 | Apply Operations to Maximize Scoreread | — | Hard | ArrayMathStack | 54% | |
| 2862 | Maximum Element-Sum of a Complete Subset of Indicesread | — | Hard | ArrayMathNumber Theory | 41% | |
| 2867 | Count Valid Paths in a Treeread | — | Hard | MathDynamic ProgrammingTree | 34% | |
| 2947 | Count Beautiful Substrings Iread | — | Medium | Hash TableMathString | 59% | |
| 2949 | Count Beautiful Substrings IIread | — | Hard | Hash TableMathString | 25% | |
| 3012 | Minimize Length of Array Using Operations | — | Medium | ArrayMathGreedy | 35% | |
| 3044 | Most Frequent Primeread | — | Medium | ArrayHash TableMath | 45% | |
| 3115 | Maximum Prime Differenceread | — | Medium | ArrayMathNumber Theory | 57% | |