| 894 | All Possible Full Binary Trees | Medium |
| 898 | Bitwise ORs of Subarrays | Medium |
| 902 | Numbers At Most N Given Digit Set | Hard |
| 903 | Valid Permutations for DI Sequence | Hard |
| 907 | Sum of Subarray Minimums | Medium |
| 913 | Cat and Mouse | Hard |
| 918 | Maximum Sum Circular Subarray | Medium |
| 920 | Number of Music Playlists | Hard |
| 926 | Flip String to Monotone Increasing | Medium |
| 931 | Minimum Falling Path Sum | Medium |
| 935 | Knight Dialer | Medium |
| 940 | Distinct Subsequences II | Hard |
| 943 | Find the Shortest Superstring | Hard |
| 964 | Least Operators to Express Number | Hard |
| 968 | Binary Tree Cameras | Hard |
| 975 | Odd Even Jump | Hard |
| 978 | Longest Turbulent Subarray | Medium |
| 983 | Minimum Cost For Tickets | Medium |
| 993 | Tallest Billboard | Hard |
| 996 | Number of Squareful Arrays | Hard |
| 1000 | Minimum Cost to Merge Stones | Hard |
| 1000 | Delete Columns to Make Sorted III | Hard |
| 1012 | Numbers With Repeated Digits | Hard |
| 1014 | Best Sightseeing Pair | Medium |
| 1024 | Video Stitching | Medium |
| 1025 | Divisor Game | Easy |
| 1027 | Longest Arithmetic Subsequence | Medium |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | Medium |
| 1035 | Uncrossed Lines | Medium |
| 1039 | Minimum Score Triangulation of Polygon | Medium |