| 1745 | Palindrome Partitioning IV | Hard |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard |
| 1755 | Closest Subsequence Sum | Hard |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard |
| 1766 | Tree of Coprimes | Hard |
| 1771 | Maximize Palindrome Length From Subsequences | Hard |
| 1776 | Car Fleet II | Hard |
| 1782 | Count Pairs Of Nodes | Hard |
| 1787 | Make the XOR of All Segments Equal to Zero | Hard |
| 1793 | Maximum Score of a Good Subarray | Hard |
| 1799 | Maximize Score After N Operations | Hard |
| 1803 | Count Pairs With XOR in a Range | Hard |
| 1808 | Maximize Number of Nice Divisors | Hard |
| 1815 | Maximum Number of Groups Getting Fresh Donuts | Hard |
| 1819 | Number of Different Subsequences GCDs | Hard |
| 1825 | Finding MK Average | Hard |
| 1830 | Minimum Number of Operations to Make String Sorted | Hard |
| 1835 | Find XOR Sum of All Pairs Bitwise AND | Hard |
| 1840 | Maximum Building Height | Hard |
| 1847 | Closest Room | Hard |
| 1851 | Minimum Interval to Include Each Query | Hard |
| 1857 | Largest Color Value in a Directed Graph | Hard |
| 1862 | Sum of Floored Pairs | Hard |
| 1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | Hard |
| 1872 | Stone Game VIII | Hard |
| 1879 | Minimum XOR Sum of Two Arrays | Hard |
| 1883 | Minimum Skips to Arrive at Meeting On Time | Hard |
| 1889 | Minimum Space Wasted From Packaging | Hard |
| 1896 | Minimum Cost to Change the Final Value of Expression | Hard |
| 1900 | The Earliest and Latest Rounds Where Players Compete | Hard |