| 62 | Unique Paths | — | Medium | MathDynamic ProgrammingCombinatorics | 66% | |
| 458 | Poor Pigs | — | Hard | MathDynamic ProgrammingCombinatorics | 59% | |
| 920 | Number of Music Playlists | — | Hard | MathDynamic ProgrammingCombinatorics | 60% | |
| 1201 | Ugly Number III | — | Medium | MathBinary SearchCombinatorics | 30% | |
| 1359 | Count All Valid Pickup and Delivery Options | — | Hard | MathDynamic ProgrammingCombinatorics | 65% | |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | — | Hard | ArrayMathDynamic Programming | 60% | |
| 1569 | Number of Ways to Reorder Array to Get Same BST | — | Hard | ArrayMathDivide and Conquer | 54% | |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | — | Medium | MathDynamic ProgrammingCombinatorics | 45% | |
| 1641 | Count Sorted Vowel Strings | — | Medium | MathDynamic ProgrammingCombinatorics | 79% | |
| 1643 | Kth Smallest Instructions | — | Hard | ArrayMathDynamic Programming | 44% | |
| 1735 | Count Ways to Make Array With Productread | — | Hard | ArrayMathDynamic Programming | 53% | |
| 1830 | Minimum Number of Operations to Make String Sorted | — | Hard | MathStringCombinatorics | 50% | |
| 1863 | Sum of All Subset XOR Totals | — | Easy | ArrayMathBacktracking | 90% | |
| 1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | — | Hard | MathDynamic ProgrammingCombinatorics | 58% | |
| 1916 | Count Ways to Build Rooms in an Ant Colony | — | Hard | MathDynamic ProgrammingTree | 48% | |
| 2063 | Vowels of All Substrings | — | Medium | MathStringDynamic Programming | 55% | |
| 2221 | Find Triangular Sum of an Array | — | Medium | ArrayMathSimulation | 79% | |
| 2338 | Count the Number of Ideal Arrays | — | Hard | MathDynamic ProgrammingCombinatorics | 57% | |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | — | Medium | MathDynamic ProgrammingCombinatorics | 36% | |
| 2514 | Count Anagrams | — | Hard | Hash TableMathString | 35% | |
| 2597 | The Number of Beautiful Subsetsread | — | Medium | ArrayHash TableMath | 51% | |
| 2842 | Count K-Subsequences of a String With Maximum Beautyread | — | Hard | Hash TableMathString | 30% | |
| 2928 | Distribute Candies Among Children I | — | Easy | MathCombinatoricsEnumeration | 73% | |
| 2929 | Distribute Candies Among Children II | — | Medium | MathCombinatoricsEnumeration | 35% | |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | — | Medium | MathDynamic ProgrammingCombinatorics | 55% | |
| 2954 | Count the Number of Infection Sequences | — | Hard | ArrayMathCombinatorics | 33% | |
| 2963 | Count the Number of Good Partitions | — | Hard | ArrayHash TableMath | 47% | |
| 3116 | Kth Smallest Amount With Single Denomination Combinationread | — | Hard | ArrayMathBinary Search | 18% | |
| 3128 | Right Triangles | — | Medium | ArrayHash TableMath | 47% | |
| 3154 | Find Number of Ways to Reach the K-th Stair | — | Hard | MathDynamic ProgrammingBit Manipulation | 36% | |
| 3179 | Find the N-th Value After K Seconds | — | Medium | ArrayMathSimulation | 54% | |
| 3250 | Find the Count of Monotonic Pairs I | — | Hard | ArrayMathDynamic Programming | 46% | |
| 3251 | Find the Count of Monotonic Pairs II | — | Hard | ArrayMathDynamic Programming | 23% | |
| 3272 | Find the Count of Good Integers | — | Hard | Hash TableMathCombinatorics | 70% | |
| 3312 | Sorted GCD Pair Queries | — | Hard | ArrayHash TableMath | 20% | |
| 3317 | Find the Number of Possible Ways for an Eventread | — | Hard | MathDynamic ProgrammingCombinatorics | 33% | |
| 3343 | Count Number of Balanced Permutations | — | Hard | MathStringDynamic Programming | 50% | |
| 3352 | Count K-Reducible Numbers Less Than Nread | — | Hard | MathStringDynamic Programming | 25% | |
| 3395 | Subsequences with a Unique Middle Mode Iread | — | Hard | ArrayHash TableMath | 17% | |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | — | Hard | MathCombinatorics | 31% | |
| 3426 | Manhattan Distances of All Arrangements of Pieces | — | Hard | MathCombinatorics | 33% | |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | — | Medium | ArrayMathDynamic Programming | 20% | |
| 3461 | Check If Digits Are Equal in String After Operations I | — | Easy | MathStringSimulation | 77% | |
| 3463 | Check If Digits Are Equal in String After Operations II | — | Hard | MathStringCombinatorics | 10% | |
| 3470 | Permutations IV | — | Hard | ArrayMathCombinatorics | 27% | |
| 3518 | Smallest Palindromic Rearrangement II | — | Hard | Hash TableMathString | 12% | |
| 3539 | Find Sum of Array Product of Magical Sequencesread | — | Hard | ArrayMathDynamic Programming | 21% | |