| 1662 | Check If Two String Arrays are Equivalent | Easy |
| 1685 | Sum of Absolute Differences in a Sorted Array | Medium |
| 1718 | Construct the Lexicographically Largest Valid Sequence | Medium |
| 1727 | Largest Submatrix With Rearrangements | Medium |
| 1732 | Find the Highest Altitude | Easy |
| 1743 | Restore the Array From Adjacent Pairs | Medium |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard |
| 1752 | Check if Array Is Sorted and Rotated | Easy |
| 1774 | Closest Dessert Cost | Medium |
| 1800 | Maximum Ascending Subarray Sum | Easy |
| 1814 | Count Nice Pairs in an Array | Medium |
| 1822 | Sign of the Product of an Array | Easy |
| 1824 | Minimum Sideway Jumps | Medium |
| 1834 | Single-Threaded CPU | Medium |
| 1838 | Frequency of the Most Frequent Element | Medium |
| 1846 | Maximum Element After Decreasing and Rearranging | Medium |
| 1851 | Minimum Interval to Include Each Query | Hard |
| 1870 | Minimum Speed to Arrive on Time | Medium |
| 1877 | Minimize Maximum Pair Sum in Array | Medium |
| 1879 | Minimum XOR Sum of Two Arrays | Hard |
| 1887 | Reduction Operations to Make the Array Elements Equal | Medium |
| 1913 | Maximum Product Difference Between Two Pairs | Easy |
| 1921 | Eliminate Maximum Number of Monsters | Medium |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard |
| 1970 | Last Day Where You Can Still Cross | Hard |
| 1980 | Find Unique Binary String | Medium |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard |
| 2050 | Parallel Courses III | Hard |
| 2125 | Number of Laser Beams in a Bank | Medium |