| 464 | Can I Win | — | Medium | MathDynamic ProgrammingBit Manipulation | 30% | |
| 473 | Matchsticks to Square | — | Medium | ArrayDynamic ProgrammingBacktracking | 41% | |
| 526 | Beautiful Arrangement | — | Medium | ArrayDynamic ProgrammingBacktracking | 64% | |
| 638 | Shopping Offers | — | Medium | ArrayDynamic ProgrammingBacktracking | 52% | |
| 691 | Stickers to Spell Word | — | Hard | ArrayHash TableString | 50% | |
| 698 | Partition to K Equal Sum Subsets | — | Medium | ArrayDynamic ProgrammingBacktracking | 38% | |
| 805 | Split Array With Same Average | — | Hard | ArrayMathDynamic Programming | 26% | |
| 847 | Shortest Path Visiting All Nodes | — | Hard | Dynamic ProgrammingBit ManipulationBreadth-First Search | 65% | |
| 943 | Find the Shortest Superstring | — | Hard | ArrayStringDynamic Programming | 44% | |
| 996 | Number of Squareful Arrays | — | Hard | ArrayHash TableMath | 50% | |
| 1125 | Smallest Sufficient Team | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 55% | |
| 1255 | Maximum Score Words Formed by Letters | — | Hard | ArrayStringDynamic Programming | 82% | |
| 1349 | Maximum Students Taking Exam | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 52% | |
| 1434 | Number of Ways to Wear Different Hats to Each Other | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 44% | |
| 1494 | Parallel Courses II | — | Hard | Dynamic ProgrammingBit ManipulationGraph | 29% | |
| 1595 | Minimum Cost to Connect Two Groups of Points | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 48% | |
| 1617 | Count Subtrees With Max Distance Between Cities | — | Hard | Dynamic ProgrammingBit ManipulationTree | 66% | |
| 1655 | Distribute Repeating Integersread | — | Hard | ArrayDynamic ProgrammingBacktracking | 40% | |
| 1659 | Maximize Grid Happiness | — | Hard | Dynamic ProgrammingBit ManipulationMemoization | 40% | |
| 1681 | Minimum Incompatibilityread | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 40% | |
| 1723 | Find Minimum Time to Finish All Jobs | — | Hard | ArrayDynamic ProgrammingBacktracking | 43% | |
| 1755 | Closest Subsequence Sum | — | Hard | ArrayTwo PointersDynamic Programming | 41% | |
| 1799 | Maximize Score After N Operations | — | Hard | ArrayMathDynamic Programming | 58% | |
| 1815 | Maximum Number of Groups Getting Fresh Donutsread | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 40% | |
| 1879 | Minimum XOR Sum of Two Arrays | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 49% | |
| 1947 | Maximum Compatibility Score Sum | — | Medium | ArrayDynamic ProgrammingBacktracking | 63% | |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | — | Medium | ArrayDynamic ProgrammingBacktracking | 34% | |
| 1994 | The Number of Good Subsetsread | — | Hard | ArrayMathDynamic Programming | 36% | |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | — | Medium | StringDynamic ProgrammingBacktracking | 61% | |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | — | Hard | ArrayTwo PointersBinary Search | 22% | |
| 2172 | Maximum AND Sum of Array | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 50% | |
| 2305 | Fair Distribution of Cookies | — | Medium | ArrayDynamic ProgrammingBacktracking | 69% | |
| 2572 | Count the Number of Square-Free Subsetsread | — | Medium | ArrayMathDynamic Programming | 25% | |
| 2741 | Special Permutations | — | Medium | ArrayDynamic ProgrammingBit Manipulation | 28% | |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | — | Hard | Dynamic ProgrammingBit ManipulationTree | 45% | |
| 3149 | Find the Minimum Cost Array Permutation | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 24% | |
| 3276 | Select Cells in Grid With Maximum Score | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 14% | |
| 3283 | Maximum Number of Moves to Kill All Pawns | — | Hard | ArrayMathBit Manipulation | 32% | |
| 3376 | Minimum Time to Break Locks I | — | Medium | ArrayDynamic ProgrammingBacktracking | 30% | |
| 3444 | Minimum Increments for Target Multiples in an Array | — | Hard | ArrayMathDynamic Programming | 25% | |
| 3530 | Maximum Profit from Valid Topological Order in DAG | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 26% | |
| 3533 | Concatenated Divisibility | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 25% | |
| 3539 | Find Sum of Array Product of Magical Sequencesread | — | Hard | ArrayMathDynamic Programming | 21% | |