| 1771 | Maximize Palindrome Length From Subsequences | StringDynamic Programming | Hard |
| 1776 | Car Fleet II | ArrayMathStack+2 | Hard |
| 1782 | Count Pairs Of Nodes | ArrayHash TableTwo Pointers+4 | Hard |
| 1787 | Make the XOR of All Segments Equal to Zero | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 1793 | Maximum Score of a Good Subarray | ArrayTwo PointersBinary Search+2 | Hard |
| 1799 | Maximize Score After N Operations | ArrayMathDynamic Programming+4 | Hard |
| 1803 | Count Pairs With XOR in a Range | ArrayBit ManipulationTrie | Hard |
| 1808 | Maximize Number of Nice Divisors | MathRecursionNumber Theory | Hard |
| 1815 | Maximum Number of Groups Getting Fresh Donuts | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 1819 | Number of Different Subsequences GCDs | ArrayMathCounting+1 | Hard |
| 1825 | Finding MK Average | DesignQueueHeap (Priority Queue)+2 | Hard |
| 1830 | Minimum Number of Operations to Make String Sorted | MathStringCombinatorics | Hard |
| 1835 | Find XOR Sum of All Pairs Bitwise AND | ArrayMathBit Manipulation | Hard |
| 1840 | Maximum Building Height | ArrayMathSorting | Hard |
| 1847 | Closest Room | ArrayBinary SearchSorting+1 | Hard |
| 1851 | Minimum Interval to Include Each Query | ArrayBinary SearchLine Sweep+2 | Hard |
| 1857 | Largest Color Value in a Directed Graph | Hash TableDynamic ProgrammingGraph+3 | Hard |
| 1862 | Sum of Floored Pairs | ArrayMathBinary Search+1 | Hard |
| 1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | MathDynamic ProgrammingCombinatorics | Hard |
| 1872 | Stone Game VIII | ArrayMathDynamic Programming+2 | Hard |
| 1879 | Minimum XOR Sum of Two Arrays | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 1883 | Minimum Skips to Arrive at Meeting On Time | ArrayDynamic Programming | Hard |
| 1889 | Minimum Space Wasted From Packaging | ArrayBinary SearchSorting+1 | Hard |
| 1896 | Minimum Cost to Change the Final Value of Expression | MathStringDynamic Programming+1 | Hard |
| 1900 | The Earliest and Latest Rounds Where Players Compete | Dynamic ProgrammingMemoization | Hard |
| 1912 | Design Movie Rental System | ArrayHash TableDesign+2 | Hard |
| 1916 | Count Ways to Build Rooms in an Ant Colony | MathDynamic ProgrammingTree+3 | Hard |
| 1923 | Longest Common Subpath | ArrayBinary SearchRolling Hash+2 | Hard |
| 1928 | Minimum Cost to Reach Destination in Time | ArrayDynamic ProgrammingGraph | Hard |
| 1931 | Painting a Grid With Three Different Colors | Dynamic Programming | Hard |
| 1932 | Merge BSTs to Create Single BST | Hash TableBinary SearchTree+2 | Hard |
| 1938 | Maximum Genetic Difference Query | ArrayHash TableBit Manipulation+2 | Hard |
| 1944 | Number of Visible People in a Queue | ArrayStackMonotonic Stack | Hard |
| 1948 | Delete Duplicate Folders in System | ArrayHash TableString+2 | Hard |
| 1955 | Count Number of Special Subsequences | ArrayDynamic Programming | Hard |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | StringRolling HashHash Function | Hard |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | ArrayBinary SearchBinary Indexed Tree | Hard |
| 1970 | Last Day Where You Can Still Cross | ArrayBinary SearchDepth-First Search+3 | Hard |
| 1977 | Number of Ways to Separate Numbers | StringDynamic ProgrammingSuffix Array | Hard |
| 1982 | Find Array Given Subset Sums | ArrayDivide and Conquer | Hard |
| 1987 | Number of Unique Good Subsequences | StringDynamic Programming | Hard |
| 1994 | The Number of Good Subsets | ArrayHash TableMath+5 | Hard |
| 1998 | GCD Sort of an Array | ArrayMathUnion Find+2 | Hard |
| 2003 | Smallest Missing Genetic Value in Each Subtree | Dynamic ProgrammingTreeDepth-First Search+1 | Hard |
| 2009 | Minimum Number of Operations to Make Array Continuous | ArrayHash TableBinary Search+1 | Hard |
| 2014 | Longest Subsequence Repeated k Times | StringBacktrackingGreedy+2 | Hard |
| 2019 | The Score of Students Solving Math Expression | ArrayMathString+3 | Hard |
| 2025 | Maximum Number of Ways to Partition an Array | ArrayHash TableCounting+2 | Hard |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | StringStackGreedy+1 | Hard |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | ArrayTwo PointersBinary Search+4 | Hard |