| ID | Title | Difficulty |
|---|---|---|
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Hard |
| 2104 | Sum of Subarray Ranges | Medium |
| 2281 | Sum of Total Strength of Wizards | Hard |
| 2289 | Steps to Make Array Non-decreasing | Medium |
| 2334 | Subarray With Elements Greater Than Varying Threshold | Hard |
| 2454 | Next Greater Element IV | Hard |
| 2487 | Remove Nodes From Linked List | Medium |
| 2736 | Maximum Sum Queries | Hard |
| 2818 | Apply Operations to Maximize Score | Hard |