| 11 | Container With Most Water | Medium | greedy |
| 42 | Trapping Rain Water | Hard | greedy |
| 45 | Jump Game II | Hard | greedy |
| 55 | Jump Game | Medium | greedy |
| 122 | Best Time to Buy and Sell Stock II | Easy | greedy |
| 134 | Gas Station | Medium | greedy |
| 135 | Candy | Hard | greedy |
| 316 | Remove Duplicate Letters | Hard | greedy |
| 321 | Create Maximum Number | Hard | greedy |
| 330 | Patching Array | Hard | greedy |
| 376 | Wiggle Subsequence | Medium | greedy |
| 392 | Is Subsequence | Medium | greedy |
| 397 | Integer Replacement | Medium | greedy |
| 402 | Remove K Digits | Medium | greedy |
| 435 | Non-overlapping Intervals | Medium | greedy |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | greedy |
| 455 | Assign Cookies | Easy | greedy |
| 484 | Find Permutation | Medium | greedy |
| 621 | Task Scheduler | Medium | greedy |
| 630 | Course Schedule III | Hard | greedy |
| 646 | Maximum Length of Pair Chain | Medium | greedy |
| 649 | Dota2 Senate | Medium | greedy |
| 659 | Split Array into Consecutive Subsequences | Medium | greedy |
| 738 | Monotone Increasing Digits | Medium | greedy |
| 757 | Set Intersection Size At Least Two | Hard | greedy |
| 759 | Employee Free Time | Hard | greedy |
| 763 | Partition Labels | Medium | greedy |
| 767 | Reorganize String | Medium | greedy |
| 798 | Smallest Rotation with Highest Score | Hard | greedy |
| 843 | Guess the Word | Hard | greedy |
| 861 | Score After Flipping Matrix | Medium | greedy |
| 870 | Advantage Shuffle | Medium | greedy |
| 881 | Boats to Save People | Medium | greedy |
| 936 | Stamping The Sequence | Hard | greedy |
| 948 | Bag of Tokens | Medium | greedy |
| 962 | Maximum Width Ramp | Medium | greedy |
| 968 | Binary Tree Cameras | Hard | greedy |
| 984 | String Without AAA or BBB | Easy | greedy |
| 991 | Broken Calculator | Medium | greedy |
| 995 | Minimum Number of K Consecutive Bit Flips | Hard | greedy |
| 1005 | Maximize Sum Of Array After K Negations | Easy | greedy |
| 1024 | Video Stitching | Medium | greedy |
| 1029 | Two City Scheduling | Easy | greedy |
| 1053 | Previous Permutation With One Swap | Medium | greedy |
| 1055 | Shortest Way to Form String | Medium | greedy |
| 1058 | Minimize Rounding Error to Meet Target | Medium | greedy |
| 1081 | Smallest Subsequence of Distinct Characters | Medium | greedy |
| 1090 | Largest Values From Labels | Medium | greedy |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | greedy |
| 1163 | Last Substring in Lexicographical Order | Hard | greedy |
| 1167 | Minimum Cost to Connect Sticks | Medium | greedy |
| 1183 | Maximum Number of Ones | Hard | greedy |
| 1196 | How Many Apples Can You Put into the Basket | Easy | greedy |
| 1199 | Minimum Time to Build Blocks | Hard | greedy |
| 1221 | Split a String in Balanced Strings | Easy | greedy |
| 1247 | Minimum Swaps to Make Strings Equal | Easy | greedy |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | greedy |
| 1253 | Reconstruct a 2-Row Binary Matrix | Medium | greedy |
| 1272 | Remove Interval | Medium | greedy |
| 1282 | Group the People Given the Group Size They Belong To | Medium | greedy |
| 1288 | Remove Covered Intervals | Medium | greedy |
| 1296 | Divide Array in Sets of K Consecutive Numbers | Medium | greedy |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | greedy |
| 1338 | Reduce Array Size to The Half | Medium | greedy |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | greedy |
| 1354 | Construct Target Array With Multiple Sums | Hard | greedy |
| 1383 | Maximum Performance of a Team | Hard | greedy |
| 1386 | Cinema Seat Allocation | Medium | greedy |
| 1400 | Construct K Palindrome Strings | Medium | greedy |
| 1402 | Reducing Dishes | Hard | greedy |
| 1403 | Minimum Subsequence in Non-Increasing Order | Easy | greedy |
| 1405 | Longest Happy String | Medium | greedy |
| 1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | Medium | greedy |
| 1419 | Minimum Number of Frogs Croaking | Medium | greedy |
| 1432 | Max Difference You Can Get From Changing an Integer | Medium | greedy |
| 1433 | Check If a String Can Break Another String | Medium | greedy |
| 1488 | Avoid Flood in The City | Medium | greedy |
| 1518 | Water Bottles | Easy | greedy |
| 1520 | Maximum Number of Non-Overlapping Substrings | Medium | greedy |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | greedy |
| 1536 | Minimum Swaps to Arrange a Binary Grid | Medium | greedy |
| 1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | Medium | greedy |
| 1564 | Put Boxes Into the Warehouse I | Medium | greedy |
| 1567 | Maximum Length of Subarray With Positive Product | Medium | greedy |
| 1578 | Minimum Deletion Cost to Avoid Repeating Letters | Medium | greedy |
| 1580 | Put Boxes Into the Warehouse II | Medium | greedy |
| 1585 | Check If String Is Transformable With Substring Sort Operations | Hard | greedy |
| 1589 | Maximum Sum Obtained of Any Permutation | Medium | greedy |
| 1591 | Strange Printer II | Hard | greedy |
| 1599 | Maximum Profit of Operating a Centennial Wheel | Medium | greedy |
| 1605 | Find Valid Matrix Given Row and Column Sums | Medium | greedy |
| 1616 | Split Two Strings to Make Palindrome | Medium | greedy |
| 1632 | Rank Transform of a Matrix | Hard | greedy |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | greedy |
| 1653 | Minimum Deletions to Make String Balanced | Medium | greedy |
| 1663 | Smallest String With A Given Numeric Value | Medium | greedy |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard | greedy |
| 1673 | Find the Most Competitive Subsequence | Medium | greedy |
| 1674 | Minimum Moves to Make Array Complementary | Medium | greedy |
| 1686 | Stone Game VI | Medium | greedy |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | greedy |
| 1702 | Maximum Binary String After Change | Medium | greedy |
| 1705 | Maximum Number of Eaten Apples | Medium | greedy |
| 1708 | Largest Subarray Length K | Easy | greedy |
| 1710 | Maximum Units on a Truck | Easy | greedy |
| 1717 | Maximum Score From Removing Substrings | Medium | greedy |
| 1725 | Number Of Rectangles That Can Form The Largest Square | Easy | greedy |
| 1727 | Largest Submatrix With Rearrangements | Medium | greedy |
| 1733 | Minimum Number of People to Teach | Medium | greedy |
| 1736 | Latest Time by Replacing Hidden Digits | Easy | greedy |
| 1737 | Change Minimum Characters to Satisfy One of Three Conditions | Medium | greedy |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium | greedy |
| 1754 | Largest Merge Of Two Strings | Medium | greedy |
| 1758 | Minimum Changes To Make Alternating Binary String | Easy | greedy |
| 1759 | Count Number of Homogenous Substrings | Medium | greedy |
| 1762 | Buildings With an Ocean View | Medium | greedy |
| 1764 | Form Array by Concatenating Subarrays of Another Array | Medium | greedy |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium | greedy |
| 1775 | Equal Sum Arrays With Minimum Number of Operations | Medium | greedy |
| 1785 | Minimum Elements to Add to Form a Given Sum | Medium | greedy |
| 1788 | Maximize the Beauty of the Garden | Hard | greedy |
| 1793 | Maximum Score of a Good Subarray | Hard | greedy |
| 1794 | Count Pairs of Equal Substrings With Minimum Difference | Medium | greedy |
| 1798 | Maximum Number of Consecutive Values You Can Make | Medium | greedy |
| 1801 | Number of Orders in the Backlog | Medium | greedy |
| 1815 | Maximum Number of Groups Getting Fresh Donuts | Hard | greedy |
| 1824 | Minimum Sideway Jumps | Medium | greedy |
| 1827 | Minimum Operations to Make the Array Increasing | Easy | greedy |
| 1833 | Maximum Ice Cream Bars | Medium | greedy |
| 1840 | Maximum Building Height | Hard | greedy |
| 1842 | Next Palindrome Using Same Digits | Hard | greedy |
| 1846 | Maximum Element After Decreasing and Rearranging | Medium | greedy |
| 1850 | Minimum Adjacent Swaps to Reach the Kth Smallest Number | Medium | greedy |
| 1864 | Minimum Number of Swaps to Make the Binary String Alternating | Medium | greedy |
| 1874 | Minimize Product Sum of Two Arrays | Medium | greedy |
| 1877 | Minimize Maximum Pair Sum in Array | Medium | greedy |
| 1881 | Maximum Value after Insertion | Medium | greedy |
| 1887 | Reduction Operations to Make the Array Elements Equal | Medium | greedy |
| 1893 | Check if All the Integers in a Range Are Covered | Easy | greedy |
| 1894 | Find the Student that Will Replace the Chalk | Medium | greedy |
| 1897 | Redistribute Characters to Make All Strings Equal | Easy | greedy |
| 1899 | Merge Triplets to Form Target Triplet | Medium | greedy |
| 1911 | Maximum Alternating Subsequence Sum | Medium | greedy |
| 1913 | Maximum Product Difference Between Two Pairs | Medium | greedy |
| 1921 | Eliminate Maximum Number of Monsters | Medium | greedy |
| 1927 | Sum Game | Medium | greedy |
| 1936 | Add Minimum Number of Rungs | Medium | greedy |
| 1946 | Largest Number After Mutating Substring | Medium | greedy |
| 1953 | Maximum Number of Weeks for Which You Can Work | Medium | greedy |
| 1975 | Maximum Matrix Sum | Medium | greedy |
| 2027 | Minimum Moves to Convert String | Easy | greedy |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Hard | greedy |
| 2036 | Maximum Alternating Subarray Sum | Medium | greedy |
| 2037 | Minimum Number of Moves to Seat Everyone | Easy | greedy |
| 2071 | Maximum Number of Tasks You Can Assign | Hard | greedy |
| 2086 | Minimum Number of Buckets Required to Collect Rainwater from Houses | Medium | greedy |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | Medium | greedy |
| 2126 | Destroying Asteroids | Medium | greedy |
| 2136 | Earliest Possible Day of Full Bloom | Hard | greedy |
| 2139 | Minimum Moves to Reach Target Score | Medium | greedy |
| 2141 | Maximum Running Time of N Computers | Hard | greedy |
| 2144 | Minimum Cost of Buying Candies With Discount | Easy | greedy |
| 2147 | Number of Ways to Divide a Long Corridor | Hard | greedy |
| 2160 | Minimum Sum of Four Digit Number After Splitting Digits | Easy | greedy |
| 2165 | Smallest Value of the Rearranged Number | Medium | greedy |
| 2178 | Maximum Split of Positive Even Integers | Medium | greedy |
| 2182 | Construct String With Repeat Limit | Medium | greedy |
| 2193 | Minimum Number of Moves to Make Palindrome | Hard | greedy |
| 2195 | Append K Integers With Minimal Sum | Medium | greedy |
| 2207 | Maximize Number of Subsequences in a String | Medium | greedy |
| 2214 | Minimum Health to Beat Game | Medium | greedy |
| 2216 | Minimum Deletions to Make Array Beautiful | Medium | greedy |
| 2224 | Minimum Number of Operations to Convert Time | Easy | greedy |
| 2259 | Remove Digit From Number to Maximize Result | Easy | greedy |
| 2263 | Make Array Non-decreasing or Non-increasing | Hard | greedy |
| 2268 | Minimum Number of Keypresses | Medium | greedy |
| 2279 | Maximum Bags With Full Capacity of Rocks | Medium | greedy |
| 2285 | Maximum Total Importance of Roads | Medium | greedy |
| 2294 | Partition Array Such That Maximum Difference Is K | Medium | greedy |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | Medium | greedy |
| 2321 | Maximum Score Of Spliced Array | Hard | greedy |
| 2323 | Find Minimum Time to Finish All Jobs II | Medium | greedy |
| 2340 | Minimum Adjacent Swaps to Make a Valid Array | Medium | greedy |
| 2366 | Minimum Replacements to Sort the Array | Hard | greedy |
| 2371 | Minimize Maximum Value in a Grid | Hard | greedy |
| 2375 | Construct Smallest Number From DI String | Medium | greedy |
| 2383 | Minimum Hours of Training to Win a Competition | Easy | greedy |
| 2384 | Largest Palindromic Number | Medium | greedy |
| 2405 | Optimal Partition of String | Medium | greedy |
| 2410 | Maximum Matching of Players With Trainers | 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 |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | greedy |
| 2436 | Minimum Split Into Subarrays With GCD Greater Than One | Medium | greedy |
| 2439 | Minimize Maximum of Array | Medium | greedy |
| 2440 | Create Components With Same Value | Hard | greedy |
| 2449 | Minimum Number of Operations to Make Arrays Similar | Hard | greedy |
| 2457 | Minimum Addition to Make Integer Beautiful | Medium | greedy |
| 2459 | Sort Array by Moving Items to Empty Space | Hard | greedy |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | greedy |
| 2479 | Maximum XOR of Two Non-Overlapping Subtrees | Hard | greedy |
| 2483 | Minimum Penalty for a Shop | Medium | greedy |
| 2486 | Append Characters to String to Make Subsequence | Medium | greedy |
| 2498 | Frog Jump II | Medium | greedy |
| 2499 | Minimum Total Cost to Make Arrays Unequal | Hard | greedy |
| 2522 | Partition String Into Substrings With Values at Most K | Medium | greedy |
| 2541 | Minimum Operations to Make Array Equal II | Medium | greedy |
| 2542 | Maximum Subsequence Score | Medium | greedy |
| 2548 | Maximum Price to Fill a Bag | Medium | greedy |
| 2551 | Put Marbles in Bags | Hard | greedy |
| 2561 | Rearranging Fruits | Hard | greedy |
| 2566 | Maximum Difference by Remapping a Digit | Easy | greedy |
| 2567 | Minimum Score by Changing Two Elements | Medium | greedy |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | greedy |
| 2573 | Find the String with LCP | Hard | greedy |
| 2576 | Find the Maximum Number of Marked Indices | Medium | greedy |
| 2578 | Split With Minimum Sum | Easy | greedy |
| 2587 | Rearrange Array to Maximize Prefix Score | Medium | greedy |
| 2589 | Minimum Time to Complete All Tasks | Hard | greedy |
| 2591 | Distribute Money to Maximum Children | Easy | greedy |
| 2599 | Make the Prefix Sum Non-negative | Medium | greedy |
| 2600 | K Items With the Maximum Sum | Easy | greedy |
| 2601 | Prime Subtraction Operation | Medium | greedy |
| 2604 | Minimum Time to Eat All Grains | Hard | greedy |
| 2606 | Find the Substring With Maximum Cost | Medium | greedy |
| 2607 | Make K-Subarray Sums Equal | Medium | greedy |
| 2611 | Mice and Cheese | Medium | greedy |
| 2645 | Minimum Additions to Make Valid String | Medium | greedy |
| 2663 | Lexicographically Smallest Beautiful String | Hard | greedy |
| 2673 | Make Costs of Paths Equal in a Binary Tree | Medium | greedy |
| 2680 | Maximum OR | Medium | greedy |
| 2697 | Lexicographically Smallest Palindrome | Easy | greedy |
| 2706 | Buy Two Chocolates | Easy | greedy |
| 2708 | Maximum Strength of a Group | Medium | greedy |
| 2712 | Minimum Cost to Make All Characters Equal | Medium | greedy |
| 2734 | Lexicographically Smallest String After Substring Operation | Medium | greedy |
| 2769 | Find the Maximum Achievable Number | Easy | greedy |
| 2772 | Apply Operations to Make All Array Elements Equal to Zero | Medium | greedy |
| 2789 | Largest Element in an Array after Merge Operations | Medium | greedy |
| 2790 | Maximum Number of Groups With Increasing Length | Hard | greedy |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard | greedy |
| 2819 | Minimum Relative Loss After Buying Chocolates | Hard | greedy |
| 2825 | Make String a Subsequence Using Cyclic Increments | Medium | greedy |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard | greedy |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | Hard | greedy |
| 2844 | Minimum Operations to Make a Special Number | Medium | greedy |
| 2847 | Smallest Number With Given Digit Product | Medium | greedy |
| 2860 | Happy Students | Medium | greedy |
| 2864 | Maximum Odd Binary Number | Easy | greedy |
| 2868 | The Wording Game | Hard | greedy |
| 2870 | Minimum Number of Operations to Make Array Empty | Medium | greedy |
| 2871 | Split Array Into Maximum Number of Subarrays | Medium | greedy |
| 2872 | Maximum Number of K-Divisible Components | Hard | greedy |
| 2892 | Minimizing Array After Replacing Pairs With Their Product | Medium | greedy |
| 2895 | Minimum Processing Time | Medium | greedy |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | Hard | greedy |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | Medium | greedy |
| 2910 | Minimum Number of Groups to Create a Valid Assignment | Medium | greedy |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | Medium | greedy |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | greedy |
| 2931 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Hard | greedy |
| 2939 | Maximum Xor Product | Medium | greedy |
| 2952 | Minimum Number of Coins to be Added | Medium | greedy |
| 2957 | Remove Adjacent Almost-Equal Characters | Medium | greedy |
| 2971 | Find Polygon With the Largest Perimeter | Medium | greedy |
| 3002 | Maximum Size of a Set After Removals | Medium | greedy |
| 3003 | Maximize the Number of Partitions After Operations | Hard | greedy |
| 3012 | Minimize Length of Array Using Operations | Medium | greedy |
| 3014 | Minimum Number of Pushes to Type Word I | Easy | greedy |
| 3016 | Minimum Number of Pushes to Type Word II | Medium | greedy |
| 3022 | Minimize OR of Remaining Elements Using Operations | Hard | greedy |
| 3035 | Maximum Palindromes After Operations | Medium | greedy |
| 3068 | Find the Maximum Sum of Node Values | Hard | greedy |
| 3074 | Apple Redistribution into Boxes | Easy | greedy |
| 3075 | Maximize Happiness of Selected Children | Medium | greedy |
| 3086 | Minimum Moves to Pick K Ones | Hard | greedy |
| 3088 | Make String Anti-palindrome | Hard | greedy |
| 3106 | Lexicographically Smallest String After Operations With Constraint | Medium | greedy |
| 3107 | Minimum Operations to Make Median of Array Equal to K | Medium | greedy |
| 3111 | Minimum Rectangles to Cover Points | Medium | greedy |
| 3114 | Latest Time You Can Obtain After Replacing Characters | Easy | greedy |
| 3119 | Maximum Number of Potholes That Can Be Fixed | Medium | greedy |
| 3170 | Lexicographically Minimum String After Removing Stars | Medium | greedy |
| 3189 | Minimum Moves to Get a Peaceful Board | Medium | greedy |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | greedy |
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | Medium | greedy |
| 3205 | Maximum Array Hopping Score I | Medium | greedy |
| 3207 | Maximum Points After Enemy Battles | Medium | greedy |
| 3216 | Lexicographically Smallest String After a Swap | Easy | greedy |
| 3218 | Minimum Cost for Cutting Cake I | Medium | greedy |
| 3219 | Minimum Cost for Cutting Cake II | Hard | greedy |
| 3221 | Maximum Array Hopping Score II | Medium | greedy |
| 3228 | Maximum Number of Operations to Move Ones to the End | Medium | greedy |
| 3229 | Minimum Operations to Make Array Equal to Target | Hard | greedy |
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | Medium | greedy |
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | Medium | greedy |
| 3273 | Minimum Amount of Damage Dealt to Bob | Hard | greedy |
| 3282 | Reach End of Array With Max Score | Medium | greedy |
| 3301 | Maximize the Total Height of Unique Towers | Medium | greedy |
| 3302 | Find the Lexicographically Smallest Valid Sequence | Medium | greedy |
| 3362 | Zero Array Transformation III | Medium | greedy |
| 3397 | Maximum Number of Distinct Elements After Operations | Medium | greedy |
| 3402 | Minimum Operations to Make Columns Strictly Increasing | Easy | greedy |
| 3403 | Find the Lexicographically Largest String From the Box I | Medium | greedy |
| 3406 | Find the Lexicographically Largest String From the Box II | Hard | greedy |
| 3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | greedy |
| 3424 | Minimum Cost to Make Arrays Identical | Medium | greedy |
| 3443 | Maximum Manhattan Distance After K Changes | Medium | greedy |
| 3457 | Eat Pizzas! | Medium | greedy |
| 3458 | Select K Disjoint Special Substrings | Medium | greedy |
| 3462 | Maximum Sum With at Most K Elements | Medium | greedy |
| 3468 | Find the Number of Copy Arrays | Medium | greedy |
| 3474 | Lexicographically Smallest Generated String | Hard | greedy |
| 3476 | Maximize Profit from Task Assignment | Medium | greedy |
| 3478 | Choose K Elements With Maximum Sum | Medium | greedy |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard | greedy |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Medium | greedy |
| 3495 | Minimum Operations to Make Array Elements Zero | Hard | greedy |
| 3496 | Maximize Score After Pair Deletions | Medium | greedy |
| 3499 | Maximize Active Section with Trade I | Medium | greedy |
| 3501 | Maximize Active Section with Trade II | Hard | greedy |
| 3506 | Find Time Required to Eliminate Bacterial Strains | Hard | greedy |
| 3511 | Make a Positive Array | Medium | greedy |
| 3517 | Smallest Palindromic Rearrangement I | Medium | greedy |
| 3518 | Smallest Palindromic Rearrangement II | Hard | greedy |
| 3523 | Make Array Non-decreasing | Medium | greedy |
| 3542 | Minimum Operations to Convert All Elements to Zero | Medium | greedy |
| 3545 | Minimum Deletions for At Most K Distinct Characters | Easy | greedy |
| 3557 | Find Maximum Number of Non Intersecting Substrings | Medium | greedy |
| 3576 | Transform Array to All Equal Elements | Medium | greedy |
| 3587 | Minimum Adjacent Swaps to Alternate Parity | Medium | greedy |
| 3627 | Maximum Median Sum of Subsequences of Size 3 | Medium | greedy |
| 3630 | Partition Array for Maximum XOR and AND | Hard | greedy |
| 3633 | Earliest Finish Time for Land and Water Rides I | Easy | greedy |
| 3635 | Earliest Finish Time for Land and Water Rides II | Medium | greedy |
| 3638 | Maximum Balanced Shipments | Medium | greedy |
| 3645 | Maximum Total from Optimal Activation Order | Medium | greedy |
| 3675 | Minimum Operations to Transform String | Medium | greedy |
| 3681 | Maximum XOR of Subsequences | Hard | greedy |
| 3689 | Maximum Total Subarray Value I | Medium | greedy |
| 3711 | Maximum Transactions Without Negative Balance | Medium | greedy |
| 3720 | Lexicographically Smallest Permutation Greater Than Target | Medium | greedy |
| 3723 | Maximize Sum of Squares of Digits | Medium | greedy |
| 3724 | Minimum Operations to Transform Array | Medium | greedy |
| 3727 | Maximum Alternating Sum of Squares | Medium | greedy |
| 3730 | Maximum Calories Burnt from Jumps | Medium | greedy |
| 3732 | Maximum Product of Three Elements After One Replacement | Medium | greedy |
| 3734 | Lexicographically Smallest Palindromic Permutation Greater Than Target | Hard | greedy |
| 3752 | Lexicographically Smallest Negated Permutation that Sums to Target | Medium | greedy |
| 3763 | Maximum Total Sum with Threshold Constraints | Medium | greedy |
| 3767 | Maximize Points After Choosing K Tasks | Medium | greedy |
| 3776 | Minimum Moves to Balance Circular Array | Medium | greedy |
| 3785 | Minimum Swaps to Avoid Forbidden Values | Hard | greedy |
| 3796 | Find Maximum Value in a Constrained Sequence | Medium | greedy |
| 3797 | Count Routes to Climb a Rectangular Grid | Hard | greedy |
| 3806 | Maximum Bitwise AND After Increment Operations | Hard | greedy |
| 3812 | Minimum Edge Toggles on a Tree | Hard | greedy |
| 3816 | Lexicographically Smallest String After Deleting Duplicate Characters | Hard | greedy |
| 3828 | Final Element After Subarray Deletions | Medium | greedy |
| 3849 | Maximum Bitwise XOR After Rearrangement | Medium | greedy |
| 3854 | Minimum Operations to Make Array Parity Alternating | Medium | greedy |
| 3858 | Minimum Bitwise OR From Grid | Medium | greedy |
| 3863 | Minimum Operations to Sort a String | Medium | greedy |
| 3868 | Minimum Cost to Equalize Arrays Using Swaps | Medium | greedy |
| 3888 | Minimum Operations to Make All Grid Elements Equal | Hard | greedy |
| 3892 | Minimum Operations to Achieve At Least K Peaks | Hard | greedy |
| 3897 | Maximum Value of Concatenated Binary Segments | Hard | greedy |
| 3914 | Minimum Operations to Make Array Non Decreasing | Medium | greedy |
| 3919 | Minimum Cost to Move Between Indices | Medium | greedy |
| 3922 | Minimum Flips to Make Binary String Coherent | Medium | greedy |
| 3947 | Maximum Number of Items From Sale II | Medium | greedy |
| 3948 | Lexicographically Maximum MEX Array | Hard | greedy |
| 3952 | Maximum Total Value of Covered Indices | Medium | greedy |
| 3961 | Maximize Sum of Device Ratings | Medium | greedy |
| 3964 | Minimum Lights to Illuminate a Road | Medium | greedy |
| 3974 | Maximum Total Sum of K Selected Elements | Medium | greedy |
| 3980 | Minimum Operations to Transform Binary String | Medium | greedy |