| Find the Peaks | Easy | 75.0% |
| Count Primes | Medium | 35.7% |
| Smallest Divisible Digit Product I | Easy | 64.4% |
| Sum of All Subset XOR Totals | Easy | 90.1% |
| Longest Mountain in Array | Medium | 41.8% |
| Reordered Power of 2 | Medium | 66.0% |
| Count Good Triplets | Easy | 85.5% |
| Maximum Number of Achievable Transfer Requests | Hard | 64.6% |
| Minimum Degree of a Connected Trio in a Graph | Hard | 44.2% |
| Check if Move is Legal | Medium | 50.0% |
| Remove Digit From Number to Maximize Result | Easy | 48.2% |
| K Divisible Elements Subarrays | Medium | 54.8% |
| Substring With Largest Variance | Hard | 46.0% |
| Sum of Number and Its Reverse | Medium | 49.3% |
| Split Message Based on Limit | Hard | 42.0% |
| Distribute Candies Among Children I | Easy | 76.2% |
| Distribute Candies Among Children II | Medium | 55.7% |
| Count Beautiful Substrings I | Medium | 60.8% |
| Find the Maximum Number of Elements in Subset | Medium | 26.8% |
| Minimum Cost to Equalize Array | Hard | 18.7% |
| Finding 3-Digit Even Numbers | Easy | 78.8% |
| Lexicographically Smallest String After Applying Operations | Medium | 79.4% |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% |
| Identify the Largest Outlier in an Array | Medium | 36.2% |
| Maximum Possible Number by Binary Concatenation | Medium | 65.3% |
| Unique 3-Digit Even Numbers | Easy | 69.1% |
| Maximum Frequency After Subarray Operation | Medium | 30.8% |
| Count the Number of Substrings With Dominant Ones | Medium | 42.1% |
| Find the Lexicographically Largest String From the Box I | Medium | 41.0% |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% |
| Number of Common Factors | Easy | 79.9% |
| Longest Subsequence Repeated k Times | Hard | 71.3% |
| Reschedule Meetings for Maximum Free Time II | Medium | 60.4% |
| Consecutive Numbers Sum | Hard | 42.6% |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% |
| Collecting Chocolates | Medium | 34.7% |
| Find the Minimum Area to Cover All Ones II | Hard | 63.5% |
| Find the Number of Ways to Place People I | Medium | 64.0% |
| Minimum Operations to Make the Integer Zero | Medium | 58.2% |
| Two-Letter Card Game | Medium | 12.2% |
| Lexicographically Smallest Permutation Greater Than Target | Medium | 26.5% |
| Count Symmetric Integers | Easy | 83.1% |
| Divide an Array Into Subarrays With Minimum Cost I | Easy | 80.5% |
| Longest Balanced Substring I | Medium | 69.7% |
| Happy Students | Medium | 50.8% |
| Maximum Rows Covered by Columns | Medium | 57.7% |
| Count the Number of Incremovable Subarrays I | Easy | 56.2% |
| Number of Possible Sets of Closing Branches | Hard | 50.6% |
| Maximum Square Area by Removing Fences From a Field | Medium | 49.4% |
| Count Special Subsequences | Medium | 29.8% |
| Shortest String That Contains Three Strings | Medium | 31.5% |
| Sum of k-Mirror Numbers | Hard | 63.7% |
| Next Greater Numerically Balanced Number | Medium | 63.0% |
| Count Square Sum Triples | Easy | 77.1% |
| Number of Black Blocks | Medium | 41.5% |
| Removing Minimum Number of Magic Beans | Medium | 44.4% |
| Count Increasing Quadruplets | Hard | 34.5% |
| Find Maximum Area of a Triangle | Medium | 29.0% |
| Sequential Digits | Medium | 65.4% |
| Minimum Cost to Set Cooking Time | Medium | 41.5% |
| Minimum Moves to Capture The Queen | Medium | 22.3% |
| Ambiguous Coordinates | Medium | 56.4% |
| Super Palindromes | Hard | 39.8% |
| Check if Word Can Be Placed In Crossword | Medium | 50.6% |
| Recover the Original Array | Hard | 41.2% |
| Maximum Score of a Node Sequence | Hard | 39.8% |
| Sum of Imbalance Numbers of All Subarrays | Hard | 43.1% |
| Find the Number of Ways to Place People II | Hard | 64.4% |
| Most Frequent Prime | Medium | 45.8% |
| Latest Time You Can Obtain After Replacing Characters | Easy | 35.1% |
| Maximum Number of Ways to Partition an Array | Hard | 35.4% |
| Number of Arithmetic Triplets | Easy | 85.4% |
| Number of Valid Clock Times | Easy | 47.9% |
| Maximum Area Rectangle With Point Constraints I | Medium | 51.3% |
| Minimum Operations to Make Character Frequencies Equal | Hard | 26.4% |
| Naming a Company | Hard | 46.5% |
| Smallest Substring With Identical Characters I | Hard | 20.3% |
| Three Divisors | Easy | 63.9% |
| Find the Count of Good Integers | Hard | 69.5% |
| Maximize Subarray GCD Score | Hard | 24.6% |
| Count Special Quadruplets | Easy | 64.4% |
| Longest Palindrome After Substring Concatenation I | Medium | 43.8% |
| Partition Array for Maximum XOR and AND | Hard | 17.5% |
| Maximum Subarray With Equal Products | Easy | 46.4% |
| Total Waviness of Numbers in Range I | Medium | 80.5% |
| Sum of Squares of Special Elements | Easy | 81.9% |
| Maximize Active Section with Trade I | Medium | 31.2% |
| Detect Pattern of Length M Repeated K or More Times | Easy | 43.7% |
| Count Almost Equal Pairs I | Medium | 38.2% |
| Maximum Total Beauty of the Gardens | Hard | 30.3% |
| Maximum Points in an Archery Competition | Medium | 51.4% |
| Largest Time for Given Digits | Medium | 35.8% |
| Coordinate With Maximum Network Quality | Medium | 39.3% |
| Number of Unique XOR Triplets II | Medium | 32.3% |
| Find the Integer Added to Array II | Medium | 32.8% |
| Partition Array into Two Equal Product Subsets | Medium | 35.1% |
| Greatest English Letter in Upper and Lower Case | Easy | 71.8% |
| Count Substrings That Differ by One Character | Medium | 72.3% |
| Maximum Good People Based on Statements | Hard | 52.2% |
| Word Squares II | Medium | 54.8% |