| 1896 | Minimum Cost to Change the Final Value of Expression | Hard |
| 1897 | Redistribute Characters to Make All Strings Equal | Easy |
| 1898 | Maximum Number of Removable Characters | Medium |
| 1899 | Merge Triplets to Form Target Triplet | Medium |
| 1900 | The Earliest and Latest Rounds Where Players Compete | Hard |
| 1901 | Find a Peak Element II | Medium |
| 1903 | Largest Odd Number in String | Easy |
| 1904 | The Number of Full Rounds You Have Played | Medium |
| 1905 | Count Sub Islands | Medium |
| 1906 | Minimum Absolute Difference Queries | Medium |
| 1909 | Remove One Element to Make the Array Strictly Increasing | Easy |
| 1910 | Remove All Occurrences of a Substring | Medium |
| 1911 | Maximum Alternating Subsequence Sum | Medium |
| 1912 | Design Movie Rental System | Hard |
| 1913 | Maximum Product Difference Between Two Pairs | Easy |
| 1914 | Cyclically Rotating a Grid | Medium |
| 1915 | Number of Wonderful Substrings | Medium |
| 1916 | Count Ways to Build Rooms in an Ant Colony | Hard |
| 1920 | Build Array from Permutation | Easy |
| 1921 | Eliminate Maximum Number of Monsters | Medium |
| 1922 | Count Good Numbers | Medium |
| 1923 | Longest Common Subpath | Hard |
| 1925 | Count Square Sum Triples | Easy |
| 1926 | Nearest Exit from Entrance in Maze | Medium |
| 1927 | Sum Game | Medium |
| 1928 | Minimum Cost to Reach Destination in Time | Hard |
| 1929 | Concatenation of Array | Easy |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium |
| 1931 | Painting a Grid With Three Different Colors | Hard |
| 1932 | Merge BSTs to Create Single BST | Hard |