2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 1148 | Article Views I | Easy |
| 1154 | Day of the Year | Easy |
| 1155 | Number of Dice Rolls With Target Sum | Medium |
| 1156 | Swap For Longest Repeated Character Substring |
Page 20 of 59
| Medium |
| 1157 | Online Majority Element In Subarray | Hard |
| 1158 | Market Analysis I | Medium |
| 1160 | Find Words That Can Be Formed by Characters | Easy |
| 1161 | Maximum Level Sum of a Binary Tree | Medium |
| 1162 | As Far from Land as Possible | Medium |
| 1163 | Last Substring in Lexicographical Order | Hard |
| 1164 | Product Price at a Given Date | Medium |
| 1169 | Invalid Transactions | Medium |
| 1170 | Compare Strings by Frequency of the Smallest Character | Medium |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium |
| 1172 | Dinner Plate Stacks | Hard |
| 1174 | Immediate Food Delivery II | Medium |
| 1175 | Prime Arrangements | Easy |
| 1177 | Can Make Palindrome from Substring | Medium |
| 1178 | Number of Valid Words for Each Puzzle | Hard |
| 1179 | Reformat Department Table | Easy |
| 1184 | Distance Between Bus Stops | Easy |
| 1185 | Day of the Week | Easy |
| 1186 | Maximum Subarray Sum with One Deletion | Medium |
| 1187 | Make Array Strictly Increasing | Hard |
| 1189 | Maximum Number of Balloons | Easy |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium |
| 1191 | K-Concatenation Maximum Sum | Medium |
| 1192 | Critical Connections in a Network | Hard |
| 1193 | Monthly Transactions I | Medium |
| 1195 | Fizz Buzz Multithreaded | Medium |
| 1200 | Minimum Absolute Difference | Easy |
| 1201 | Ugly Number III | Medium |
| 1202 | Smallest String With Swaps | Medium |
| 1203 | Sort Items by Groups Respecting Dependencies | Hard |
| 1204 | Last Person to Fit in the Bus | Medium |
| 1206 | Design Skiplist | Hard |
| 1207 | Unique Number of Occurrences | Easy |
| 1208 | Get Equal Substrings Within Budget | Medium |
| 1209 | Remove All Adjacent Duplicates in String II | Medium |
| 1210 | Minimum Moves to Reach Target with Rotations | Hard |
| 1211 | Queries Quality and Percentage | Easy |
| 1217 | Minimum Cost to Move Chips to The Same Position | Easy |
| 1218 | Longest Arithmetic Subsequence of Given Difference | Medium |
| 1219 | Path with Maximum Gold | Medium |
| 1220 | Count Vowels Permutation | Hard |
| 1221 | Split a String in Balanced Strings | Easy |
| 1222 | Queens That Can Attack the King | Medium |
| 1223 | Dice Roll Simulation | Hard |
| 1224 | Maximum Equal Frequency | Hard |
| 1226 | The Dining Philosophers | Medium |
© 2026 PhantomCodeAI. All rights reserved.