| 2202 | Maximize the Topmost Element After K Moves | Medium | constructive algorithms |
| 2335 | Minimum Amount of Time to Fill Cups | Easy | constructive algorithms |
| 2350 | Shortest Impossible Sequence of Rolls | Hard | constructive algorithms |
| 2358 | Maximum Number of Groups Entering a Competition | Medium | constructive algorithms |
| 2375 | Construct Smallest Number From DI String | Medium | greedy |
| 2412 | Minimum Money Required Before Transactions | Hard | greedy |
| 2417 | Closest Fair Integer | Medium | greedy |
| 2422 | Merge Operations to Turn Array Into a Palindrome | Medium | greedy |
| 2546 | Apply Bitwise Operations to Make Strings Equal | Medium | constructive algorithms |
| 2573 | Find the String with LCP | Hard | greedy |
| 2610 | Convert an Array Into a 2D Array With Conditions | Medium | constructive algorithms |
| 2647 | Color the Triangle Red | Hard | constructive algorithms |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium | constructive algorithms |
| 2728 | Count Houses in a Circular Street | Easy | constructive algorithms |
| 2732 | Find a Good Subset of the Matrix | Hard | constructive algorithms |
| 2745 | Construct the Longest New String | Medium | constructive algorithms |
| 2753 | Count Houses in a Circular Street II | Hard | constructive algorithms |
| 2790 | Maximum Number of Groups With Increasing Length | Hard | greedy |
| 2811 | Check if it is Possible to Split Array | Medium | constructive algorithms |
| 2829 | Determine the Minimum Sum of a k-avoiding Array | Medium | constructive algorithms |
| 2834 | Find the Minimum Possible Sum of a Beautiful Array | Medium | constructive algorithms |
| 2849 | Determine if a Cell Is Reachable at a Given Time | Medium | constructive algorithms |
| 2856 | Minimum Array Length After Pair Removals | Medium | constructive algorithms |
| 3139 | Minimum Cost to Equalize Array | Hard | constructive algorithms |
| 3260 | Find the Largest Palindrome Divisible by K | Hard | constructive algorithms |
| 3311 | Construct 2D Grid Matching Graph Layout | Hard | constructive algorithms |
| 3375 | Minimum Operations to Make Array Values Equal to K | Easy | constructive algorithms |
| 3644 | Maximum K to Sort a Permutation | Medium | sort |
| 3680 | Generate Schedule | Medium | constructive algorithms |
| 3875 | Construct Uniform Parity Array I | Easy | constructive algorithms |
| 3876 | Construct Uniform Parity Array II | Medium | constructive algorithms |
| 3988 | Create Grid With Exactly K Paths I | Medium | constructive algorithms |
| 3990 | Create Grid With Exactly K Paths II | Hard | constructive algorithms |