| 1019 | Next Greater Node In Linked List | Medium |
| 1021 | Remove Outermost Parentheses | Easy |
| 1047 | Remove All Adjacent Duplicates In String | Easy |
| 1081 | Smallest Subsequence of Distinct Characters | Medium |
| 1096 | Brace Expansion II | Hard |
| 1106 | Parsing A Boolean Expression | Hard |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium |
| 1124 | Longest Well-Performing Interval | Medium |
| 1130 | Minimum Cost Tree From Leaf Values | Medium |
| 1172 | Dinner Plate Stacks | Hard |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium |
| 1209 | Remove All Adjacent Duplicates in String II | Medium |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium |
| 1381 | Design a Stack With Increment Operation | Medium |
| 1441 | Build an Array With Stack Operations | Medium |
| 1472 | Design Browser History | Medium |
| 1475 | Final Prices With a Special Discount in a Shop | Easy |
| 1504 | Count Submatrices With All Ones | Medium |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard |
| 1541 | Minimum Insertions to Balance a Parentheses String | Medium |
| 1544 | Make The String Great | Easy |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium |
| 1598 | Crawler Log Folder | Easy |
| 1614 | Maximum Nesting Depth of the Parentheses | Easy |
| 1653 | Minimum Deletions to Make String Balanced | Medium |
| 1673 | Find the Most Competitive Subsequence | Medium |
| 1700 | Number of Students Unable to Eat Lunch | Easy |
| 1717 | Maximum Score From Removing Substrings | Medium |
| 1776 | Car Fleet II | Hard |
| 1793 | Maximum Score of a Good Subarray | Hard |