| Unique Paths | Medium | 66.6% |
| Count All Valid Pickup and Delivery Options | Hard | 64.9% |
| Sum of All Subset XOR Totals | Easy | 90.1% |
| Count Ways to Build Rooms in an Ant Colony | Hard | 51.1% |
| Check If Digits Are Equal in String After Operations II | Hard | 14.2% |
| Find Triangular Sum of an Array | Medium | 82.0% |
| Find the Number of Possible Ways for an Event | Hard | 34.9% |
| Check If Digits Are Equal in String After Operations I | Easy | 82.5% |
| Distribute Candies Among Children II | Medium | 55.7% |
| Find Number of Ways to Reach the K-th Stair | Hard | 37.5% |
| Count the Number of Ideal Arrays | Hard | 56.9% |
| The Number of Beautiful Subsets | Medium | 50.9% |
| Distribute Candies Among Children I | Easy | 76.2% |
| Distribute Candies Among Children III | Hard | 57.2% |
| Count the Number of K-Free Subsets | Medium | 47.2% |
| Number of Sets of K Non-Overlapping Line Segments | Medium | 45.6% |
| Count Ways to Make Array With Product | Hard | 54.4% |
| Manhattan Distances of All Arrangements of Pieces | Hard | 35.1% |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% |
| Count the Number of Computer Unlocking Permutations | Medium | 59.0% |
| Kth Smallest Instructions | Hard | 44.7% |
| Ugly Number III | Medium | 31.3% |
| Maximum and Minimum Sums of at Most Size K Subsequences | Medium | 21.6% |
| Find the Count of Monotonic Pairs I | Hard | 47.5% |
| Maximum Score with Co-Prime Element | Hard | |
| Find the Count of Monotonic Pairs II | Hard | 24.6% |
| Number of Music Playlists | Hard | 60.0% |
| Number of Ways to Reorder Array to Get Same BST | Hard | 54.0% |
| Find Nth Smallest Integer With K One Bits | Hard | 34.1% |
| Number of Ways to Reach a Position After Exactly k Steps | Medium | |
| Count Number of Balanced Permutations | Hard | 49.1% |
| Find the Count of Good Integers | Hard | 69.5% |
| Count K-Subsequences of a String With Maximum Beauty | Hard | 30.2% |
| Poor Pigs | Hard | 59.1% |
| Count the Number of Good Partitions | Hard | 49.0% |
| Number of Ways to Rearrange Sticks With K Sticks Visible | Hard | 60.5% |
| Sorted GCD Pair Queries | Hard | 22.3% |
| Right Triangles | Medium | 48.4% |
| Count Sorted Vowel Strings | Medium | 79.2% |
| Find the Derangement of An Array | Medium | 41.7% |
| Count Anagrams | Hard | 37.0% |
| Number of Strings Which Can Be Rearranged to Contain Substring | Medium | 57.0% |
| Count the Number of Good Subsequences | Medium | 48.3% |
| Count the Number of Infection Sequences | Hard | 37.2% |
| Minimum Number of Operations to Make String Sorted | Hard | 50.7% |
| Count K-Reducible Numbers Less Than N | Hard | 27.6% |
| Vowels of All Substrings | Medium | 55.2% |
| Number of Ways to Reach Destination in the Grid | Hard | 58.2% |
| Find the N-th Value After K Seconds | Medium | 53.8% |