| 2109 | Adding Spaces to a String | ArrayTwo PointersString+1 | Medium |
| 2110 | Number of Smooth Descent Periods of a Stock | ArrayMathDynamic Programming | Medium |
| 2111 | Minimum Operations to Make the Array K-Increasing | ArrayBinary Search | Hard |
| 2114 | Maximum Number of Words Found in Sentences | ArrayString | Easy |
| 2115 | Find All Possible Recipes from Given Supplies | ArrayHash TableString+2 | Medium |
| 2116 | Check if a Parentheses String Can Be Valid | StringStackGreedy | Medium |
| 2117 | Abbreviating the Product of a Range | Math | Hard |
| 2119 | A Number After a Double Reversal | Math | Easy |
| 2120 | Execution of All Suffix Instructions Staying in a Grid | StringSimulation | Medium |
| 2121 | Intervals Between Identical Elements | ArrayHash TablePrefix Sum | Medium |
| 2122 | Recover the Original Array | ArrayHash TableTwo Pointers+2 | Hard |
| 2124 | Check if All A's Appears Before All B's | String | Easy |
| 2125 | Number of Laser Beams in a Bank | ArrayMathString+1 | Medium |
| 2126 | Destroying Asteroids | ArrayGreedySorting | Medium |
| 2127 | Maximum Employees to Be Invited to a Meeting | Depth-First SearchGraphTopological Sort | Hard |
| 2129 | Capitalize the Title | String | Easy |
| 2130 | Maximum Twin Sum of a Linked List | Linked ListTwo PointersStack | Medium |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | ArrayHash TableString+2 | Medium |
| 2132 | Stamping the Grid | ArrayGreedyMatrix+1 | Hard |
| 2133 | Check if Every Row and Column Contains All Numbers | ArrayHash TableMatrix | Easy |
| 2134 | Minimum Swaps to Group All 1's Together II | ArraySliding Window | Medium |
| 2135 | Count Words Obtained After Adding a Letter | ArrayHash TableString+2 | Medium |
| 2136 | Earliest Possible Day of Full Bloom | ArrayGreedySorting | Hard |
| 2138 | Divide a String Into Groups of Size k | StringSimulation | Easy |
| 2139 | Minimum Moves to Reach Target Score | MathGreedy | Medium |
| 2140 | Solving Questions With Brainpower | ArrayDynamic Programming | Medium |
| 2141 | Maximum Running Time of N Computers | ArrayBinary SearchGreedy+1 | Hard |
| 2144 | Minimum Cost of Buying Candies With Discount | ArrayGreedySorting | Easy |
| 2145 | Count the Hidden Sequences | ArrayPrefix Sum | Medium |
| 2146 | K Highest Ranked Items Within a Price Range | ArrayBreadth-First SearchSorting+2 | Medium |
| 2147 | Number of Ways to Divide a Long Corridor | MathStringDynamic Programming | Hard |
| 2148 | Count Elements With Strictly Smaller and Greater Elements | ArraySortingCounting | Easy |
| 2149 | Rearrange Array Elements by Sign | ArrayTwo PointersSimulation | Medium |
| 2150 | Find All Lonely Numbers in the Array | ArrayHash TableCounting | Medium |
| 2151 | Maximum Good People Based on Statements | ArrayBacktrackingBit Manipulation+1 | Hard |
| 2154 | Keep Multiplying Found Values by Two | ArrayHash TableSorting+1 | Easy |
| 2155 | All Divisions With the Highest Score of a Binary Array | Array | Medium |
| 2156 | Find Substring With Given Hash Value | StringSliding WindowRolling Hash+1 | Hard |
| 2157 | Groups of Strings | StringBit ManipulationUnion Find | Hard |
| 2160 | Minimum Sum of Four Digit Number After Splitting Digits | MathGreedySorting | Easy |
| 2161 | Partition Array According to Given Pivot | ArrayTwo PointersSimulation | Medium |
| 2162 | Minimum Cost to Set Cooking Time | MathEnumeration | Medium |
| 2163 | Minimum Difference in Sums After Removal of Elements | ArrayDynamic ProgrammingHeap (Priority Queue) | Hard |
| 2164 | Sort Even and Odd Indices Independently | ArraySorting | Easy |
| 2165 | Smallest Value of the Rearranged Number | MathSorting | Medium |
| 2166 | Design Bitset | ArrayHash TableString+1 | Medium |
| 2167 | Minimum Time to Remove All Cars Containing Illegal Goods | StringDynamic Programming | Hard |
| 2169 | Count Operations to Obtain Zero | MathSimulation | Easy |
| 2170 | Minimum Operations to Make the Array Alternating | ArrayHash TableGreedy+1 | Medium |
| 2171 | Removing Minimum Number of Magic Beans | ArrayGreedySorting+2 | Medium |