| 321 | Create Maximum Number | Hard |
| 402 | Remove K Digits | Medium |
| 456 | 132 Pattern | Medium |
| 496 | Next Greater Element I | Easy |
| 503 | Next Greater Element II | Medium |
| 581 | Shortest Unsorted Continuous Subarray | Medium |
| 654 | Maximum Binary Tree | Medium |
| 739 | Daily Temperatures | Medium |
| 768 | Max Chunks To Make Sorted II | Hard |
| 769 | Max Chunks To Make Sorted | Medium |
| 853 | Car Fleet | Medium |
| 901 | Online Stock Span | Medium |
| 907 | Sum of Subarray Minimums | Medium |
| 962 | Maximum Width Ramp | Medium |
| 975 | Odd Even Jump | Hard |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium |
| 1019 | Next Greater Node In Linked List | Medium |
| 1081 | Smallest Subsequence of Distinct Characters | Medium |
| 1124 | Longest Well-Performing Interval | Medium |
| 1130 | Minimum Cost Tree From Leaf Values | 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 |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium |
| 1673 | Find the Most Competitive Subsequence | Medium |
| 1776 | Car Fleet II | Hard |
| 1793 | Maximum Score of a Good Subarray | Hard |
| 1856 | Maximum Subarray Min-Product | Medium |
| 1944 | Number of Visible People in a Queue | Hard |
| 1996 | The Number of Weak Characters in the Game | Medium |