| Smallest Divisible Digit Product II | Hard | 14.4% |
| Count Primes | Medium | 35.8% |
| Add Digits | Easy | 68.6% |
| Check If Digits Are Equal in String After Operations II | Hard | 14.2% |
| Number of Different Subsequences GCDs | Hard | 45.0% |
| Minimum Jumps to Reach End via Prime Teleportation | Medium | 31.8% |
| The kth Factor of n | Medium | 70.2% |
| Fancy Sequence | Hard | 18.6% |
| Smallest Even Multiple | Easy | 88.3% |
| Minimum Deletions to Make Array Divisible | Hard | 60.0% |
| Find Triangular Sum of an Array | Medium | 82.0% |
| Minimum Number of Primes to Sum to Target | Medium | 59.6% |
| Most Expensive Item That Can Not Be Bought | Medium | 80.4% |
| Check If Digits Are Equal in String After Operations I | Easy | 82.5% |
| GCD Sort of an Array | Hard | 48.5% |
| Count Beautiful Substrings I | Medium | 61.0% |
| Prime Palindrome | Medium | 28.0% |
| Closest Prime Numbers in Range | Medium | 51.7% |
| Mirror Reflection | Medium | 61.9% |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% |
| Number of Pairs of Interchangeable Rectangles | Medium | 52.4% |
| Count the Number of Ideal Arrays | Hard | 56.9% |
| Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium | 54.6% |
| Count Beautiful Substrings II | Hard | 26.8% |
| Count Ways to Make Array With Product | Hard | 54.4% |
| Minimum Division Operations to Make Array Non Decreasing | Medium | 29.1% |
| Prime Subtraction Operation | Medium | 55.6% |
| Number of Common Factors | Easy | 79.9% |
| Find the Largest Palindrome Divisible by K | Hard | 16.9% |
| Balanced K-Factor Decomposition | Medium | 40.0% |
| Ugly Number III | Medium | 31.3% |
| Sum of Perfect Square Ancestors | Hard | 42.5% |
| Minimum Stability Factor of Array | Hard | 20.3% |
| Minimize Array Sum Using Divisible Replacements | Medium | |
| Sum of GCD of Formed Pairs | Medium | |
| Minimize the Maximum of Two Arrays | Medium | 32.2% |
| Find Greatest Common Divisor of Array | Easy | 79.7% |
| Number of Subarrays With LCM Equal to K | Medium | 43.4% |
| Maximum Score with Co-Prime Element | Hard | |
| Abbreviating the Product of a Range | Hard | 24.9% |
| Three Divisors | Easy | 63.9% |
| Insert Greatest Common Divisors in Linked List | Medium | 91.4% |
| GCD of Odd and Even Sums | Easy | 84.8% |
| Minimize Length of Array Using Operations | Medium | 35.7% |
| Check If It Is a Good Array | Hard | 63.4% |
| Count Valid Paths in a Tree | Hard | 36.0% |
| Minimum Operations to Transform Array into Alternating Prime | Medium | |
| X of a Kind in a Deck of Cards | Easy | 30.1% |
| Count Sequences to K | Hard | |
| Maximize Subarray GCD Score | Hard | 24.7% |
| Count the Number of Square-Free Subsets | Medium | 26.4% |
| Largest Component Size by Common Factor | Hard | 42.4% |
| Apply Operations to Maximize Score | Hard | 53.7% |
| Maximum Subarray With Equal Products | Easy | 46.5% |
| Simplified Fractions | Medium | 69.6% |
| Most Frequent Prime | Medium | 45.8% |
| Minimum Lines to Represent a Line Chart | Medium | 26.9% |
| Tree of Coprimes | Hard | 43.8% |
| Sorted GCD Pair Queries | Hard | 22.3% |
| Count Prime-Gap Balanced Subarrays | Medium | 22.5% |
| Sum of Beautiful Subsequences | Hard | 31.3% |
| Distinct Prime Factors of Product of Array | Medium | 54.2% |
| Largest Prime from Consecutive Prime Sum | Medium | 38.9% |
| Prime In Diagonal | Easy | 37.4% |
| Find the Number of Subsequences With Equal GCD | Hard | 31.5% |
| Maximize Count of Distinct Primes After Split | Hard | |
| Digit Operations to Make Two Integers Equal | Medium | 29.8% |
| Find the Maximum Factor Score of Array | Medium | 40.9% |
| The Number of Good Subsets | Hard | 37.1% |
| Make K-Subarray Sums Equal | Medium | 38.2% |
| Sum of Largest Prime Substrings | Medium | 37.8% |
| Count Array Pairs Divisible by K | Hard | 30.6% |
| Check if Point Is Reachable | Hard | 44.8% |
| Maximum Element-Sum of a Complete Subset of Indices | Hard | 42.7% |
| Number of Self-Divisible Permutations | Medium | 71.7% |
| Maximize Score After N Operations | Hard | 57.9% |
| Maximum GCD-Sum of a Subarray | Hard | 38.6% |
| Graph Connectivity With Threshold | Hard | 49.2% |
| Maximum Prime Difference | Medium | 58.6% |
| Split the Array to Make Coprime Products | Hard | 28.7% |