|No.|Swift && Title|C++|Python3|Kotlin|Difficulty| | ------ | ------ | ------ | ------ | ------ | ------ | | 1326 | Minimum Number of Taps to Open to Water a Garden | ✓ | ✓ | ✓ | Hard | | 1325 | Delete Leaves With a Given Value | ✓ | ✓ | ✓ | Medium | | 1324 | Print Words Vertically | ✓ | ✓ | ✓ | Medium | | 1323 | Maximum 69 Number | ✓ | ✓ | ✓ | Easy | | 1322 | | ✓ | ✓ | ✓ | Easy | | 1321 | | ✓ | ✓ | ✓ | Medium | | 1320 | Minimum Distance to Type a Word Using Two Fingers | ✓ | ✓ | ✓ | Hard | | 1319 | Number of Operations to Make Network Connected | ✓ | ✓ | ✓ | Medium | | 1318 | Minimum Flips to Make a OR b Equal to c | ✓ | ✓ | ✓ | Medium | | 1317 | Convert Integer to the Sum of Two No-Zero Integers | ✓ | ✓ | ✓ | Easy | | 1316 | Distinct Echo Substrings | ✓ | ✓ | ✓ | Hard | | 1315 | Sum of Nodes with Even-Valued Grandparent | ✓ | ✓ | ✓ | Medium | | 1314 | Matrix Block Sum | ✓ | ✓ | ✓ | Medium | | 1313 | Decompress Run-Length Encoded List | ✓ | ✓ | ✓ | Easy | | 1312 | Minimum Insertion Steps to Make a String Palindrome | ✓ | ✓ | ✓ | Hard | | 1311 | Get Watched Videos by Your Friends | ✓ | ✓ | ✓ | Medium | | 1310 | XOR Queries of a Subarray | ✓ | ✓ | ✓ | Medium | | 1309 | Decrypt String from Alphabet to Integer Mapping | ✓ | ✓ | ✓ | Easy | | 1308 | | ✓ | ✓ | ✓ | Medium | | 1307 | Verbal Arithmetic Puzzle | ✓ | ✓ | ✓ | Hard | | 1306 | Jump Game III | ✓ | ✓ | ✓ | Medium | | 1305 | All Elements in Two Binary Search Trees | ✓ | ✓ | ✓ | Medium | | 1304 | Find N Unique Integers Sum up to Zero | ✓ | ✓ | ✓ | Easy | | 1303 | | ✓ | ✓ | ✓ | Easy | | 1302 | Deepest Leaves Sum | ✓ | ✓ | ✓ | Medium | | 1301 | Number of Paths with Max Score | ✓ | ✓ | ✓ | Hard | | 1300 | Sum of Mutated Array Closest to Target | ✓ | ✓ | ✓ | Medium | | 1299 | Replace Elements with Greatest Element on Right Side | ✓ | ✓ | ✓ | Easy | | 1298 | Maximum Candies You Can Get from Boxes | ✓ | ✓ | ✓ | Hard | | 1297 | Maximum Number of Occurrences of a Substring | ✓ | ✓ | ✓ | Medium | | 1296 | Divide Array in Sets of K Consecutive Numbers | ✓ | ✓ | ✓ | Medium | | 1295 | Find Numbers with Even Number of Digits | ✓ | ✓ | ✓ | Easy | | 1294 | | ✓ | ✓ | ✓ | Easy | | 1293 | Shortest Path in a Grid with Obstacles Elimination | ✓ | ✓ | ✓ | Hard | | 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | ✓ | ✓ | ✓ | Medium | | 1291 | Sequential Digits | ✓ | ✓ | ✓ | Medium | | 1290 | Convert Binary Number in a Linked List to Integer | ✓ | ✓ | ✓ | Easy | | 1289 | Minimum Falling Path Sum II | ✓ | ✓ | ✓ | Hard | | 1288 | Remove Covered Intervals | ✓ | ✓ | ✓ | Medium | | 1287 | Element Appearing More Than 25% In Sorted Array | ✓ | ✓ | ✓ | Easy | | 1286 | Iterator for Combination | ✓ | ✓ | ✓ | Medium | | 1285 | | ✓ | ✓ | ✓ | Medium | | 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | ✓ | ✓ | ✓ | Hard | | 1283 | Find the Smallest Divisor Given a Threshold | ✓ | ✓ | ✓ | Medium | | 1282 | Group the People Given the Group Size They Belong To | ✓ | ✓ | ✓ | Medium | | 1281 | Subtract the Product and Sum of Digits of an Integer | ✓ | ✓ | ✓ | Easy | | 1280 | | ✓ | ✓ | ✓ | Easy | | 1279 | | ✓ | ✓ | ✓ | Easy | | 1278 | Palindrome Partitioning III | ✓ | ✓ | ✓ | Hard | | 1277 | Count Square Submatrices with All Ones | ✓ | ✓ | ✓ | Medium | | 1276 | Number of Burgers with No Waste of Ingredients | ✓ | ✓ | ✓ | Medium | | 1275 | Find Winner on a Tic Tac Toe Game | ✓ | ✓ | ✓ | Easy | | 1274 | | ✓ | ✓ | ✓ | Hard | | 1273 | | ✓ | ✓ | ✓ | Medium | | 1272 | | ✓ | ✓ | ✓ | Medium | | 1271 | | ✓ | ✓ | ✓ | Easy | | 1270 | | ✓ | ✓ | ✓ | Medium | | 1269 | Number of Ways to Stay in the Same Place After Some Steps | ✓ | ✓ | ✓ | Hard | | 1268 | Search Suggestions System | ✓ | ✓ | ✓ | Medium | | 1267 | Count Servers that Communicate | ✓ | ✓ | ✓ | Medium | | 1266 | Minimum Time Visiting All Points | ✓ | ✓ | ✓ | Easy | | 1265 | | ✓ | ✓ | ✓ | Medium | | 1264 | | ✓ | ✓ | ✓ | Medium | | 1263 | | ✓ | ✓ | ✓ | Hard | | 1262 | | ✓ | ✓ | ✓ | Medium | | 1261 | | ✓ | ✓ | ✓ | Medium | | 1260 | | ✓ | ✓ | ✓ | Easy | | 1259 | | ✓ | ✓ | ✓ | Hard | | 1258 | | ✓ | ✓ | ✓ | Medium | | 1257 | | ✓ | ✓ | ✓ | Medium | | 1256 | | ✓ | ✓ | ✓ | Medium | | 1255 | Maximum Score Words Formed by Letters | ✓ | ✓ | ✓ | Hard | | 1254 | Number of Closed Islands | ✓ | ✓ | ✓ | Medium | | 1253 | Reconstruct a 2-Row Binary Matrix | ✓ | ✓ | ✓ | Medium | | 1252 | Cells with Odd Values in a Matrix | ✓ | ✓ | ✓ | Easy | | 1251 | | ✓ | ✓ | ✓ | Easy | | 1250 | Check If It Is a Good Array | ✓ | ✓ | ✓ | Hard | | 1249 | Minimum Remove to Make Valid Parentheses | ✓ | ✓ | ✓ | Medium | | 1248 | Count Number of Nice Subarrays | ✓ | ✓ | ✓ | Medium | | 1247 | Minimum Swaps to Make Strings Equal | ✓ | ✓ | ✓ | Medium | | 1246 | | ✓ | ✓ | ✓ | Hard | | 1245 | | ✓ | ✓ | ✓ | Medium | | 1244 | | ✓ | ✓ | ✓ | Medium | | 1243 | | ✓ | ✓ | ✓ | Easy | | 1242 | | ✓ | ✓ | ✓ | Medium | | 1241 | | ✓ | ✓ | ✓ | Easy | | 1240 | Tiling a Rectangle with the Fewest Squares | ✓ | ✓ | ✓ | Hard | | 1239 | Maximum Length of a Concatenated String with Unique Characters | ✓ | ✓ | ✓ | Medium | | 1238 | Circular Permutation in Binary Representation | ✓ | ✓ | ✓ | Medium | | 1237 | Find Positive Integer Solution for a Given Equation | ✓ | ✓ | ✓ | Easy | | 1236 | | ✓ | ✓ | ✓ | Medium | | 1235 | Maximum Profit in Job Scheduling | ✓ | ✓ | ✓ | Hard | | 1234 | Replace the Substring for Balanced String | ✓ | ✓ | ✓ | Medium | | 1233 | Remove Sub-Folders from the Filesystem | ✓ | ✓ | ✓ | Medium | | 1232 | Check If It Is a Straight Line | ✓ | ✓ | ✓ | Easy | | 1231 | | ✓ | ✓ | ✓ | Hard | | 1230 | | ✓ | ✓ | ✓ | Medium | | 1229 | | ✓ | ✓ | ✓ | Medium | | 1228 | | ✓ | ✓ | ✓ | Easy | | 1227 | Airplane Seat Assignment Probability | ✓ | ✓ | ✓ | Medium | | 1226 | The Dining Philosophers | ✓ | ✓ | ✓ | Medium | | 1225 | Report Contiguous Dates | ✓ | ✓ | ✓ | Hard | | 1224 | Maximum Equal Frequency | ✓ | ✓ | ✓ | Hard | | 1223 | Dice Roll Simulation | ✓ | ✓ | ✓ | Medium | | 1222 | Queens That Can Attack the King | ✓ | ✓ | ✓ | Medium | | 1221 | Split a String in Balanced Strings | ✓ | ✓ | ✓ | Easy | | 1220 | Count Vowels Permutation | ✓ | ✓ | ✓ | Hard | | 1219 | Path with Maximum Gold | ✓ | ✓ | ✓ | Medium | | 1218 | Longest Arithmetic Subsequence of Given Difference | ✓ | ✓ | ✓ | Medium | | 1217 | Play with Chips | ✓ | ✓ | ✓ | Easy | | 1216 | Valid Palindrome III | ✓ | ✓ | ✓ | Hard | | 1215 | Stepping Numbers | ✓ | ✓ | ✓ | Medium | | 1214 | Two Sum BSTs | ✓ | ✓ | ✓ | Medium | | 1213 | Intersection of Three Sorted Arrays | ✓ | ✓ | ✓ | Easy | | 1212 | | ✓ | ✓ | ✓ | Medium | | 1211 | | ✓ | ✓ | ✓ | Easy | | 1210 | Minimum Moves to Reach Target with Rotations | ✓ | ✓ | ✓ | Hard | | 1209 | Remove All Adjacent Duplicates in String II | ✓ | ✓ | ✓ | Medium | | 1208 | Get Equal Substrings Within Budget | ✓ | ✓ | ✓ | Medium | | 1207 | Unique Number of Occurrences | ✓ | ✓ | ✓ | Easy | | 1206 | | ✓ | ✓ | ✓ | Hard | | 1205 | | ✓ | ✓ | ✓ | Medium | | 1204 | | ✓ | ✓ | ✓ | Medium | | 1203 | Sort Items by Groups Respecting Dependencies | ✓ | ✓ | ✓ | Hard | | 1202 | Smallest String With Swaps | ✓ | ✓ | ✓ | Medium | | 1201 | Ugly Number III | ✓ | ✓ | ✓ | Medium | | 1200 | Minimum Absolute Difference | ✓ | ✓ | ✓ | Easy | | 1199 | Minimum Time To Build Blocks | ✓ | ✓ | ✓ | Hard | | 1198 | Find Smallest Common Element in All Rows | ✓ | ✓ | ✓ | Medium | | 1197 | Minimum Knight Moves | ✓ | ✓ | ✓ | Medium | | 1196 | How Many Apples Can You Put into the Basket | ✓ | ✓ | ✓ | Easy | | 1195 | Fizz Buzz Multithreaded | ✓ | ✓ | ✓ | Medium | | 1194 | | ✓ | ✓ | ✓ | Hard | | 1193 | | ✓ | ✓ | ✓ | Medium | | 1192 | Critical Connections in a Network | ✓ | ✓ | ✓ | Hard | | 1191 | K-Concatenation Maximum Sum | ✓ | ✓ | ✓ | Medium | | 1190 | Reverse Substrings Between Each Pair of Parentheses | ✓ | ✓ | ✓ | Medium | | 1189 | Maximum Number of Balloons | ✓ | ✓ | ✓ | Easy | | 1188 | | ✓ | ✓ | ✓ | Medium | | 1187 | Make Array Strictly Increasing | ✓ | ✓ | ✓ | Hard | | 1186 | Maximum Subarray Sum with One Deletion | ✓ | ✓ | ✓ | Medium | | 1185 | Day of the Week | ✓ | ✓ | ✓ | Easy | | 1184 | Distance Between Bus Stops | ✓ | ✓ | ✓ | Easy | | 1183 | Maximum Number of Ones | ✓ | ✓ | ✓ | Hard | | 1182 | Shortest Distance to Target Color | ✓ | ✓ | ✓ | Medium | | 1181 | Before and After Puzzle | ✓ | ✓ | ✓ | Medium | | 1180 | Count Substrings with Only One Distinct Letter | ✓ | ✓ | ✓ | Easy | | 1179 | Reformat Department Table | ✓ | ✓ | ✓ | Easy | | 1178 | Number of Valid Words for Each Puzzle | ✓ | ✓ | ✓ | Hard | | 1177 | Can Make Palindrome from Substring | ✓ | ✓ | ✓ | Medium | | 1176 | Diet Plan Performance | ✓ | ✓ | ✓ | Easy | | 1175 | Prime Arrangements | ✓ | ✓ | ✓ | Easy | | 1174 | | ✓ | ✓ | ✓ | Medium | | 1173 | | ✓ | ✓ | ✓ | Easy | | 1172 | Dinner Plate Stacks | ✓ | ✓ | ✓ | Hard | | 1171 | Remove Zero Sum Consecutive Nodes from Linked List | ✓ | ✓ | ✓ | Medium | | 1170 | Compare Strings by Frequency of the Smallest Character | ✓ | ✓ | ✓ | Easy | | 1169 | Invalid Transactions | ✓ | ✓ | ✓ | Easy | | 1168 | Optimize Water Distribution in a Village | ✓ | ✓ | ✓ | Hard | | 1167 | Minimum Cost to Connect Sticks | ✓ | ✓ | ✓ | Medium | | 1166 | Design File System | ✓ | ✓ | ✓ | Medium | | 1165 | Single-Row Keyboard | ✓ | ✓ | ✓ | Easy | | 1164 | | ✓ | ✓ | ✓ | Medium | | 1163 | Last Substring in Lexicographical Order | ✓ | ✓ | ✓ | Hard | | 1162 | As Far from Land as Possible | ✓ | ✓ | ✓ | Medium | | 1161 | Maximum Level Sum of a Binary Tree | ✓ | ✓ | ✓ | Medium | | 1160 | Find Words That Can Be Formed by Characters | ✓ | ✓ | ✓ | Easy | | 1159 | | ✓ | ✓ | ✓ | Hard | | 1158 | | ✓ | ✓ | ✓ | Medium | | 1157 | Online Majority Element In Subarray | ✓ | ✓ | ✓ | Hard | | 1156 | Swap For Maximum Repeated Substring | ✓ | ✓ | ✓ | Medium | | 1155 | Number of Dice Rolls With Target Sum | ✓ | ✓ | ✓ | Medium | | 1154 | Ordinal Number Of Date | ✓ | ✓ | ✓ | Easy | | 1153 | String Transforms Into Another String | ✓ | ✓ | ✓ | Hard | | 1152 | Analyze User Website Visit Pattern | ✓ | ✓ | ✓ | Medium | | 1151 | Minimum Swaps to Group All 1's Together | ✓ | ✓ | ✓ | Medium | | 1150 | Check If a Number Is Majority Element in a Sorted Array | ✓ | ✓ | ✓ | Easy | | 1149 | | ✓ | ✓ | ✓ | Medium | | 1148 | | ✓ | ✓ | ✓ | Easy | | 1147 | Longest Chunked Palindrome Decomposition | ✓ | ✓ | ✓ | Hard | | 1146 | Snapshot Array | ✓ | ✓ | ✓ | Medium | | 1145 | Binary Tree Coloring Game | ✓ | ✓ | ✓ | Hard | | 1144 | Decrease Elements To Make Array Zigzag | ✓ | ✓ | ✓ | Easy | | 1143 | Longest Common Subsequence | ✓ | ✓ | ✓ | Easy | | 1142 | | ✓ | ✓ | ✓ | Medium | | 1141 | | ✓ | ✓ | ✓ | Medium | | 1140 | Stone Game II | ✓ | ✓ | ✓ | Medium | | 1139 | Largest 1-Bordered Square | ✓ | ✓ | ✓ | Medium | | 1138 | Alphabet Board Path | ✓ | ✓ | ✓ | Medium | | 1137 | N-th Tribonacci Number | ✓ | ✓ | ✓ | Easy | | 1136 | Parallel Courses | ✓ | ✓ | ✓ | Hard | | 1135 | Connecting Cities With Minimum Cost | ✓ | ✓ | ✓ | Medium | | 1134 | Armstrong Number | ✓ | ✓ | ✓ | Hard | | 1133 | Largest Unique Number | ✓ | ✓ | ✓ | Easy | | 1132 | | ✓ | ✓ | ✓ | Easy | | 1131 | Maximum of Absolute Value Expression | ✓ | ✓ | ✓ | Medium | | 1130 | Minimum Cost Tree From Leaf Values | ✓ | ✓ | ✓ | Medium | | 1129 | Shortest Path with Alternating Colors | ✓ | ✓ | ✓ | Medium | | 1128 | Number of Equivalent Domino Pairs | ✓ | ✓ | ✓ | Easy | | 1127 | | ✓ | ✓ | ✓ | Hard | | 1126 | | ✓ | ✓ | ✓ | Medium | | 1125 | Smallest Sufficient Team | ✓ | ✓ | ✓ | Hard | | 1124 | Longest Well-Performing Interval | ✓ | ✓ | ✓ | Medium | | 1123 | Lowest Common Ancestor of Deepest Leaves | ✓ | ✓ | ✓ | Medium | | 1122 | Relative Sort Array | ✓ | ✓ | ✓ | Easy | | 1121 | Divide Array Into Increasing Sequences | ✓ | ✓ | ✓ | Hard | | 1120 | Maximum Average Subtree | ✓ | ✓ | ✓ | Medium | | 1119 | Remove Vowels from a String | ✓ | ✓ | ✓ | Easy | | 1118 | Number of Days in a Month | ✓ | ✓ | ✓ | Easy | | 1117 | Building H2O | ✓ | ✓ | ✓ | Hard | | 1116 | Print Zero Even Odd | ✓ | ✓ | ✓ | Medium | | 1115 | Print FooBar Alternately | ✓ | ✓ | ✓ | Medium | | 1114 | Print in Order | ✓ | ✓ | ✓ | Easy | | 1113 | | ✓ | ✓ | ✓ | Easy | | 1112 | | ✓ | ✓ | ✓ | Medium | | 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | ✓ | ✓ | ✓ | Medium | | 1110 | Delete Nodes And Return Forest | ✓ | ✓ | ✓ | Medium | | 1109 | Corporate Flight Bookings | ✓ | ✓ | ✓ | Medium | | 1108 | Defanging an IP Address | ✓ | ✓ | ✓ | Easy | | 1107 | | ✓ | ✓ | ✓ | Medium | | 1106 | Parsing A Boolean Expression | ✓ | ✓ | ✓ | Hard | | 1105 | Filling Bookcase Shelves | ✓ | ✓ | ✓ | Medium | | 1104 | Path In Zigzag Labelled Binary Tree | ✓ | ✓ | ✓ | Easy | | 1103 | Distribute Candies to People | ✓ | ✓ | ✓ | Easy | | 1102 | Path With Maximum Minimum Value | ✓ | ✓ | ✓ | Medium | | 1101 | The Earliest Moment When Everyone Become Friends | ✓ | ✓ | ✓ | Medium | | 1100 | Find K-Length Substrings With No Repeated Characters | ✓ | ✓ | ✓ | Medium | | 1099 | Two Sum Less Than K | ✓ | ✓ | ✓ | Easy | | 1098 | | ✓ | ✓ | ✓ | Medium | | 1097 | | ✓ | ✓ | ✓ | Hard | | 1096 | Brace Expansion II | ✓ | ✓ | ✓ | Hard | | 1095 | Find in Mountain Array | ✓ | ✓ | ✓ | Hard | | 1094 | Car Pooling | ✓ | ✓ | ✓ | Medium | | 1093 | Statistics from a Large Sample | ✓ | ✓ | ✓ | Medium | | 1092 | Shortest Common Supersequence | ✓ | ✓ | ✓ | Hard | | 1091 | Shortest Path in Binary Matrix | ✓ | ✓ | ✓ | Medium | | 1090 | Largest Values From Labels | ✓ | ✓ | ✓ | Medium | | 1089 | Duplicate Zeros | ✓ | ✓ | ✓ | Easy | | 1088 | Confusing Number II | ✓ | ✓ | ✓ | Hard | | 1087 | Permutation of Letters | ✓ | ✓ | ✓ | Medium | | 1086 | High Five | ✓ | ✓ | ✓ | Easy | | 1085 | Sum of Digits in the Minimum Number | ✓ | ✓ | ✓ | Easy | | 1084 | | ✓ | ✓ | ✓ | Easy | | 1083 | | ✓ | ✓ | ✓ | Easy | | 1082 | | ✓ | ✓ | ✓ | Easy | | 1081 | Smallest Subsequence of Distinct Characters | ✓ | ✓ | ✓ | Medium | | 1080 | Insufficient Nodes in Root to Leaf Paths | ✓ | ✓ | ✓ | Medium | | 1079 | Letter Tile Possibilities | ✓ | ✓ | ✓ | Medium | | 1078 | Occurrences After Bigram | ✓ | ✓ | ✓ | Easy | | 1077 | | ✓ | ✓ | ✓ | Medium | | 1076 | | ✓ | ✓ | ✓ | Easy | | 1075 | | ✓ | ✓ | ✓ | Easy | | 1074 | Number of Submatrices That Sum to Target | ✓ | ✓ | ✓ | Hard | | 1073 | Adding Two Negabinary Numbers | ✓ | ✓ | ✓ | Medium | | 1072 | Flip Columns For Maximum Number of Equal Rows | ✓ | ✓ | ✓ | Medium | | 1071 | Greatest Common Divisor of Strings | ✓ | ✓ | ✓ | Easy | | 1070 | | ✓ | ✓ | ✓ | Medium | | 1069 | | ✓ | ✓ | ✓ | Easy | | 1068 | | ✓ | ✓ | ✓ | Easy | | 1067 | Digit Count in Range | ✓ | ✓ | ✓ | Hard | | 1066 | Campus Bikes II | ✓ | ✓ | ✓ | Medium | | 1065 | Index Pairs of a String | ✓ | ✓ | ✓ | Easy | | 1064 | Fixed Point | ✓ | ✓ | ✓ | Easy | | 1063 | | ✓ | ✓ | ✓ | Hard | | 1062 | | ✓ | ✓ | ✓ | Medium | | 1061 | | ✓ | ✓ | ✓ | Medium | | 1060 | | ✓ | ✓ | ✓ | Medium | | 1059 | | ✓ | ✓ | ✓ | Hard | | 1058 | | ✓ | ✓ | ✓ | Medium | | 1057 | | ✓ | ✓ | ✓ | Medium | | 1056 | | ✓ | ✓ | ✓ | Easy | | 1055 | | ✓ | ✓ | ✓ | Medium | | 1054 | Distant Barcodes | ✓ | ✓ | ✓ | Medium | | 1053 | Previous Permutation With One Swap | ✓ | ✓ | ✓ | Medium | | 1052 | Grumpy Bookstore Owner | ✓ | ✓ | ✓ | Medium | | 1051 | Height Checker | ✓ | ✓ | ✓ | Easy | | 1050 | Actors and Directors Who Cooperated At Least Three Times | ✓ | ✓ | ✓ | Easy | | 1049 | Last Stone Weight II | ✓ | ✓ | ✓ | Medium | | 1048 | Longest String Chain | ✓ | ✓ | ✓ | Medium | | 1047 | Remove All Adjacent Duplicates In String | ✓ | ✓ | ✓ | Easy | | 1046 | Last Stone Weight | ✓ | ✓ | ✓ | Easy | | 1045 | Customers Who Bought All Products | ✓ | ✓ | ✓ | Medium | | 1043 | Partition Array for Maximum Sum | ✓ | ✓ | ✓ | Medium | | 1042 | Flower Planting With No Adjacent | ✓ | ✓ | ✓ | Easy | | 1041 | Robot Bounded In Circle | ✓ | ✓ | ✓ | Easy | | 1040 | Moving Stones Until Consecutive II | ✓ | ✓ | ✓ | Medium | | 1039 | Minimum Score Triangulation of Polygon | ✓ | ✓ | ✓ | Medium | | 1038 | Binary Search Tree to Greater Sum Tree | ✓ | ✓ | ✓ | Medium | | 1037 | Valid Boomerang | ✓ | ✓ | ✓ | Easy | | 1036 | Escape a Large Maze | ✓ | ✓ | ✓ | Hard | | 1035 | Uncrossed Lines | ✓ | ✓ | ✓ | Medium | | 1034 | Coloring A Border | ✓ | ✓ | ✓ | Medium | | 1033 | Moving Stones Until Consecutive | ✓ | ✓ | ✓ | Easy | | 1032 | Stream of Characters | ✓ | ✓ | ✓ | Hard | | 1031 | Maximum Sum of Two Non-Overlapping Subarrays | ✓ | ✓ | ✓ | Medium | | 1030 | Matrix Cells in Distance Order | ✓ | ✓ | ✓ | Easy | | 1029 | Two City Scheduling | ✓ | ✓ | ✓ | Easy | | 1028 | Recover a Tree From Preorder Traversal | ✓ | ✓ | ✓ | Hard | | 1027 | Longest Arithmetic Sequence | ✓ | ✓ | ✓ | Medium | | 1026 | Maximum Difference Between Node and Ancestor | ✓ | ✓ | ✓ | Medium | | 1025 | Divisor Game | ✓ | ✓ | ✓ | Easy | | 1024 | Video Stitching | ✓ | ✓ | ✓ | Medium | | 1023 | Camelcase Matching | ✓ | ✓ | ✓ | Medium | | 1022 | Sum of Root To Leaf Binary Numbers | ✓ | ✓ | ✓ | Easy | | 1021 | Remove Outermost Parentheses | ✓ | ✓ | ✓ | Easy | | 1020 | Number of Enclaves | ✓ | ✓ | ✓ | Medium | | 1019 | Next Greater Node In Linked List | ✓ | ✓ | ✓ | Medium | | 1018 | Binary Prefix Divisible By 5 | ✓ | ✓ | ✓ | Easy | | 1017 | Convert to Base -2 | ✓ | ✓ | ✓ | Medium | | 1016 | Binary String With Substrings Representing 1 To N | ✓ | ✓ | ✓ | Medium | | 1015 | Smallest Integer Divisible by K | ✓ | ✓ | ✓ | Medium | | 1014 | Best Sightseeing Pair | ✓ | ✓ | ✓ | Medium | | 1013 | Partition Array Into Three Parts With Equal Sum | ✓ | ✓ | ✓ | Easy | | 1012 | Numbers With 1 Repeated Digit | ✓ | ✓ | ✓ | Hard | | 1011 | Capacity To Ship Packages Within D Days | ✓ | ✓ | ✓ | Medium | | 1010 | Pairs of Songs With Total Durations Divisible by 60 | ✓ | ✓ | ✓ | Easy | | 1009 | Complement of Base 10 Integer | ✓ | ✓ | ✓ | Easy | | 1008 | Construct Binary Search Tree from Preorder Traversal | ✓ | ✓ | ✓ | Medium | | 1007 | Minimum Domino Rotations For Equal Row | ✓ | ✓ | ✓ | Medium | | 1006 | Clumsy Factorial | ✓ | ✓ | ✓ | Medium | | 1005 | Maximize Sum Of Array After K Negations | ✓ | ✓ | ✓ | Easy | | 1004 | Max Consecutive Ones III | ✓ | ✓ | ✓ | Medium | | 1003 | Check If Word Is Valid After Substitutions | ✓ | ✓ | ✓ | Medium | | 1002 | Find Common Characters | ✓ | ✓ | ✓ | Easy | | 1001 | Grid Illumination | ✓ | ✓ | ✓ | Hard | | 1000 | Minimum Cost to Merge Stones | ✓ | ✓ | ✓ | Hard | | 999 | Available Captures for Rook | ✓ | ✓ | ✓ | Easy | | 998 | Maximum Binary Tree II | ✓ | ✓ | ✓ | Medium | | 997 | Find the Town Judge | ✓ | ✓ | ✓ | Easy | | 996 | Number of Squareful Arrays | ✓ | ✓ | ✓ | Hard | | 995 | Minimum Number of K Consecutive Bit Flips | ✓ | ✓ | ✓ | Hard | | 994 | Rotting Oranges | ✓ | ✓ | ✓ | Easy | | 993 | Cousins in Binary Tree | ✓ | ✓ | ✓ | Easy | | 992 | Subarrays with K Different Integers | ✓ | ✓ | ✓ | Hard | | 991 | Broken Calculator | ✓ | ✓ | ✓ | Medium | | 990 | Satisfiability of Equality Equations | ✓ | ✓ | ✓ | Medium | | 989 | Add to Array-Form of Integer | ✓ | ✓ | ✓ | Easy | | 988 | Smallest String Starting From Leaf | ✓ | ✓ | ✓ | Medium | | 987 | Vertical Order Traversal of a Binary Tree | ✓ | ✓ | ✓ | Medium | | 986 | Interval List Intersections | ✓ | ✓ | ✓ | Medium | | 985 | Sum of Even Numbers After Queries | ✓ | ✓ | ✓ | Easy | | 984 | String Without AAA or BBB | ✓ | ✓ | ✓ | Medium | | 983 | Minimum Cost For Tickets | ✓ | ✓ | ✓ | Medium | | 982 | Triples with Bitwise AND Equal To Zero | ✓ | ✓ | ✓ | Hard | | 981 | Time Based Key-Value Store | ✓ | ✓ | ✓ | Medium | | 980 | Unique Paths III | ✓ | ✓ | ✓ | Hard | | 979 | Distribute Coins in Binary Tree | ✓ | ✓ | ✓ | Medium | | 978 | Longest Turbulent Subarray | ✓ | ✓ | ✓ | Medium | | 977 | Squares of a Sorted Array | ✓ | ✓ | ✓ | Easy | | 976 | Largest Perimeter Triangle | ✓ | ✓ | ✓ | Easy | | 975 | Odd Even Jump | ✓ | ✓ | ✓ | Hard | | 974 | Subarray Sums Divisible by K | ✓ | ✓ | ✓ | Medium | | 973 | K Closest Points to Origin | ✓ | ✓ | ✓ | Medium | | 972 | Equal Rational Numbers | ✓ | ✓ | ✓ | Hard | | 971 | Flip Binary Tree To Match Preorder Traversal | ✓ | ✓ | ✓ | Medium | | 970 | Powerful Integers | ✓ | ✓ | ✓ | Easy | | 969 | Pancake Sorting | ✓ | ✓ | ✓ | Medium | | 968 | Binary Tree Cameras | ✓ | ✓ | ✓ | Hard | | 967 | Numbers With Same Consecutive Differences | ✓ | ✓ | ✓ | Medium | | 966 | Vowel Spellchecker | ✓ | ✓ | ✓ | Medium | | 965 | Univalued Binary Tree | ✓ | ✓ | ✓ | Easy | | 964 | Least Operators to Express Number | ✓ | ✓ | ✓ | Hard | | 963 | Minimum Area Rectangle II | ✓ | ✓ | ✓ | Medium | | 962 | Maximum Width Ramp | ✓ | ✓ | ✓ | Medium | | 961 | N-Repeated Element in Size 2N Array | ✓ | ✓ | ✓ | Easy | | 960 | Delete Columns to Make Sorted III | ✓ | ✓ | ✓ | Hard | | 959 | Regions Cut By Slashes | ✓ | ✓ | ✓ | Medium | | 958 | Check Completeness of a Binary Tree | ✓ | ✓ | ✓ | Medium | | 957 | Prison Cells After N Days | ✓ | ✓ | ✓ | Medium | | 956 | Tallest Billboard | ✓ | ✓ | ✓ | Hard | | 955 | Delete Columns to Make Sorted II | ✓ | ✓ | ✓ | Medium | | 954 | Array of Doubled Pairs | ✓ | ✓ | ✓ | Medium | | 953 | Verifying an Alien Dictionary | ✓ | ✓ | ✓ | Easy | | 952 | Largest Component Size by Common Factor | ✓ | ✓ | ✓ | Hard | | 951 | Flip Equivalent Binary Trees | ✓ | ✓ | ✓ | Medium | | 950 | Reveal Cards In Increasing Order | ✓ | ✓ | ✓ | Medium | | 949 | Largest Time for Given Digits | ✓ | ✓ | ✓ | Easy | | 948 | Bag of Tokens | ✓ | ✓ | ✓ | Medium | | 947 | Most Stones Removed with Same Row or Column | ✓ | ✓ | ✓ | Medium | | 946 | Validate Stack Sequences | ✓ | ✓ | ✓ | Medium | | 945 | Minimum Increment to Make Array Unique | ✓ | ✓ | ✓ | Medium | | 944 | Delete Columns to Make Sorted | ✓ | ✓ | ✓ | Easy | | 943 | Find the Shortest Superstring | ✓ | ✓ | ✓ | Hard | | 942 | DI String Match | ✓ | ✓ | ✓ | Easy | | 941 | Valid Mountain Array | ✓ | ✓ | ✓ | Easy | | 940 | Distinct Subsequences II | ✓ | ✓ | ✓ | Hard | | 939 | Minimum Area Rectangle | ✓ | ✓ | ✓ | Medium | | 938 | Range Sum of BST | ✓ | ✓ | ✓ | Medium | | 937 | Reorder Log Files | ✓ | ✓ | ✓ | Easy | | 936 | Stamping The Sequence | ✓ | ✓ | ✓ | Hard | | 935 | Knight Dialer | ✓ | ✓ | ✓ | Medium | | 934 | Shortest Bridge | ✓ | ✓ | ✓ | Medium | | 933 | Number of Recent Calls | ✓ | ✓ | ✓ | Easy | | 932 | Beautiful Array | ✓ | ✓ | ✓ | Medium | | 931 | Minimum Falling Path Sum | ✓ | ✓ | ✓ | Medium | | 930 | Binary Subarrays With Sum | ✓ | ✓ | ✓ | Medium | | 929 | Unique Email Addresses | ✓ | ✓ | ✓ | Easy | | 928 | Minimize Malware Spread II | ✓ | ✓ | ✓ | Hard | | 927 | Three Equal Parts | ✓ | ✓ | ✓ | Hard | | 926 | Flip String to Monotone Increasing | ✓ | ✓ | ✓ | Medium | | 925 | Long Pressed Name | ✓ | ✓ | ✓ | Easy | | 924 | Minimize Malware Spread | ✓ | ✓ | ✓ | Hard | | 923 | 3Sum With Multiplicity | ✓ | ✓ | ✓ | Medium | | 922 | Sort Array By Parity II | ✓ | ✓ | ✓ | Easy | | 921 | Minimum Add to Make Parentheses Valid | ✓ | ✓ | ✓ | Medium | | 920 | Number of Music Playlists | ✓ | ✓ | ✓ | Hard | | 919 | Complete Binary Tree Inserter | ✓ | ✓ | ✓ | Medium | | 918 | Maximum Sum Circular Subarray | ✓ | ✓ | ✓ | Medium | | 917 | Reverse Only Letters | ✓ | ✓ | ✓ | Easy | | 916 | Word Subsets | ✓ | ✓ | ✓ | Medium | | 915 | Partition Array into Disjoint Intervals | ✓ | ✓ | ✓ | Medium | | 914 | X of a Kind in a Deck of Cards | ✓ | ✓ | ✓ | Easy | | 913 | Cat and Mouse | ✓ | ✓ | ✓ | Hard | | 912 | Sort an Array | ✓ | ✓ | ✓ | Medium | | 911 | Online Election | ✓ | ✓ | ✓ | Medium | | 910 | Smallest Range II | ✓ | ✓ | ✓ | Medium | | 909 | Snakes and Ladders | ✓ | ✓ | ✓ | Medium | | 908 | Smallest Range I | ✓ | ✓ | ✓ | Easy | | 907 | Sum of Subarray Minimums | ✓ | ✓ | ✓ | Medium | | 906 | Super Palindromes | ✓ | ✓ | ✓ | Hard | | 905 | Sort Array By Parity | ✓ | ✓ | ✓ | Easy | | 904 | Fruit Into Baskets | ✓ | ✓ | ✓ | Medium | | 903 | Valid Permutations for DI Sequence | ✓ | ✓ | ✓ | Hard | | 902 | Numbers At Most N Given Digit Set | ✓ | ✓ | ✓ | Hard | | 901 | Online Stock Span | ✓ | ✓ | ✓ | Medium | | 900 | RLE Iterator | ✓ | ✓ | ✓ | Medium | | 899 | Orderly Queue | ✓ | ✓ | ✓ | Hard | | 898 | Bitwise ORs of Subarrays | ✓ | ✓ | ✓ | Medium | | 897 | Increasing Order Search Tree | ✓ | ✓ | ✓ | Easy | | 896 | Monotonic Array | ✓ | ✓ | ✓ | Easy | | 895 | Maximum Frequency Stack | ✓ | ✓ | ✓ | Hard | | 894 | All Possible Full Binary Trees | ✓ | ✓ | ✓ | Medium | | 893 | Groups of Special-Equivalent Strings | ✓ | ✓ | ✓ | Easy | | 892 | Surface Area of 3D Shapes | ✓ | ✓ | ✓ | Easy | | 891 | Sum of Subsequence Widths | ✓ | ✓ | ✓ | Hard | | 890 | Find and Replace Pattern | ✓ | ✓ | ✓ | Medium | | 889 | Construct Binary Tree from Preorder and Postorder Traversal | ✓ | ✓ | ✓ | Medium | | 888 | Fair Candy Swap | ✓ | ✓ | ✓ | Easy | | 887 | Super Egg Drop | ✓ | ✓ | ✓ | Hard | | 886 | Possible Bipartition | ✓ | ✓ | ✓ | Medium | | 885 | Spiral Matrix III | ✓ | ✓ | ✓ | Medium | | 884 | Uncommon Words from Two Sentences | ✓ | ✓ | ✓ | Easy | | 883 | Projection Area of 3D Shapes | ✓ | ✓ | ✓ | Easy | | 882 | Reachable Nodes In Subdivided Graph | ✓ | ✓ | ✓ | Hard | | 881 | Boats to Save People | ✓ | ✓ | ✓ | Medium | | 880 | Decoded String at Index | ✓ | ✓ | ✓ | Medium | | 879 | Profitable Schemes | ✓ | ✓ | ✓ | Hard | | 878 | Nth Magical Number | ✓ | ✓ | ✓ | Hard | | 877 | Stone Game | ✓ | ✓ | ✓ | Medium | | 876 | Middle of the Linked List | ✓ | ✓ | ✓ | Easy | | 875 | Koko Eating Bananas | ✓ | ✓ | ✓ | Medium | | 874 | Walking Robot Simulation | ✓ | ✓ | ✓ | Easy | | 873 | Length of Longest Fibonacci Subsequence | ✓ | ✓ | ✓ | Medium | | 872 | Leaf-Similar Trees | ✓ | ✓ | ✓ | Easy | | 871 | Minimum Number of Refueling Stops | ✓ | ✓ | ✓ | Hard | | 870 | Advantage Shuffle | ✓ | ✓ | ✓ | Medium | | 869 | Reordered Power of 2 | ✓ | ✓ | ✓ | Medium | | 868 | Binary Gap | ✓ | ✓ | ✓ | Easy | | 867 | Transpose Matrix | ✓ | ✓ | ✓ | Easy | | 866 | Prime Palindrome | ✓ | ✓ | ✓ | Medium | | 865 | Smallest Subtree with all the Deepest Nodes | ✓ | ✓ | ✓ | Medium | | 864 | Shortest Path to Get All Keys | ✓ | ✓ | ✓ | Hard | | 863 | All Nodes Distance K in Binary Tree | ✓ | ✓ | ✓ | Medium | | 862 | Shortest Subarray with Sum at Least K | ✓ | ✓ | ✓ | Hard | | 861 | Score After Flipping Matrix | ✓ | ✓ | ✓ | Medium | | 860 | Lemonade Change | ✓ | ✓ | ✓ | Easy | | 859 | Buddy Strings | ✓ | ✓ | ✓ | Easy | | 858 | Mirror Reflection | ✓ | ✓ | ✓ | Medium | | 857 | Minimum Cost to Hire K Workers | ✓ | ✓ | ✓ | Hard | | 856 | Score of Parentheses | ✓ | ✓ | ✓ | Medium | | 855 | Exam Room | ✓ | ✓ | ✓ | Medium | | 854 | K-Similar Strings | ✓ | ✓ | ✓ | Hard | | 853 | Car Fleet | ✓ | ✓ | ✓ | Medium | | 852 | Peak Index in a Mountain Array | ✓ | ✓ | ✓ | Easy | | 851 | Loud and Rich | ✓ | ✓ | ✓ | Medium | | 850 | Rectangle Area II | ✓ | ✓ | ✓ | Hard | | 849 | Maximize Distance to Closest Person | ✓ | ✓ | ✓ | Easy | | 848 | Shifting Letters | ✓ | ✓ | ✓ | Medium | | 847 | Shortest Path Visiting All Nodes | ✓ | ✓ | ✓ | Hard | | 846 | Hand of Straights | ✓ | ✓ | ✓ | Medium | | 845 | Longest Mountain in Array | ✓ | ✓ | ✓ | Medium | | 844 | Backspace String Compare | ✓ | ✓ | ✓ | Easy | | 843 | Guess the Word | ✓ | ✓ | ✓ | Hard | | 842 | Split Array into Fibonacci Sequence | ✓ | ✓ | ✓ | Medium | | 841 | Keys and Rooms | ✓ | ✓ | ✓ | Medium | | 840 | Magic Squares In Grid | ✓ | ✓ | ✓ | Easy | | 839 | Similar String Groups | ✓ | ✓ | ✓ | Hard | | 838 | Push Dominoes | ✓ | ✓ | ✓ | Medium | | 837 | New 21 Game | ✓ | ✓ | ✓ | Medium | | 836 | Rectangle Overlap | ✓ | ✓ | ✓ | Easy | | 835 | Image Overlap | ✓ | ✓ | ✓ | Medium | | 834 | Sum of Distances in Tree | ✓ | ✓ | ✓ | Hard | | 833 | Find And Replace in String | ✓ | ✓ | ✓ | Medium | | 832 | Flipping an Image | ✓ | ✓ | ✓ | Easy | | 831 | Masking Personal Information | ✓ | ✓ | ✓ | Medium | | 830 | Positions of Large Groups | ✓ | ✓ | ✓ | Easy | | 829 | Consecutive Numbers Sum | ✓ | ✓ | ✓ | Hard | | 828 | Unique Letter String | ✓ | ✓ | ✓ | Hard | | 827 | Making A Large Island | ✓ | ✓ | ✓ | Hard | | 826 | Most Profit Assigning Work | ✓ | ✓ | ✓ | Medium | | 825 | Friends Of Appropriate Ages | ✓ | ✓ | ✓ | Medium | | 824 | Goat Latin | ✓ | ✓ | ✓ | Easy | | 823 | Binary Trees With Factors | ✓ | ✓ | ✓ | Medium | | 822 | Card Flipping Game | ✓ | ✓ | ✓ | Medium | | 821 | Shortest Distance to a Character | ✓ | ✓ | ✓ | Easy | | 820 | Short Encoding of Words | ✓ | ✓ | ✓ | Medium | | 819 | Most Common Word | ✓ | ✓ | ✓ | Easy | | 818 | Race Car | ✓ | ✓ | ✓ | Hard | | 817 | Linked List Components | ✓ | ✓ | ✓ | Medium | | 816 | Ambiguous Coordinates | ✓ | ✓ | ✓ | Medium | | 815 | Bus Routes | ✓ | ✓ | ✓ | Hard | | 814 | Binary Tree Pruning | ✓ | ✓ | ✓ | Medium | | 813 | Largest Sum of Averages | ✓ | ✓ | ✓ | Medium | | 812 | Largest Triangle Area | ✓ | ✓ | ✓ | Easy | | 811 | Subdomain Visit Count | ✓ | ✓ | ✓ | Easy | | 810 | Chalkboard XOR Game | ✓ | ✓ | ✓ | Hard | | 809 | Expressive Words | ✓ | ✓ | ✓ | Medium | | 808 | Soup Servings | ✓ | ✓ | ✓ | Medium | | 807 | Max Increase to Keep City Skyline | ✓ | ✓ | ✓ | Medium | | 806 | Number of Lines To Write String | ✓ | ✓ | ✓ | Easy | | 805 | Split Array With Same Average | ✓ | ✓ | ✓ | Hard | | 804 | Unique Morse Code Words | ✓ | ✓ | ✓ | Easy | | 803 | Bricks Falling When Hit | ✓ | ✓ | ✓ | Hard | | 802 | Find Eventual Safe States | ✓ | ✓ | ✓ | Medium | | 801 | Minimum Swaps To Make Sequences Increasing | ✓ | ✓ | ✓ | Medium | | 800 | | ✓ | ✓ | ✓ | Easy | | 799 | Champagne Tower | ✓ | ✓ | ✓ | Medium | | 798 | Smallest Rotation with Highest Score | ✓ | ✓ | ✓ | Hard | | 797 | All Paths From Source to Target | ✓ | ✓ | ✓ | Medium | | 796 | Rotate String | ✓ | ✓ | ✓ | Easy | | 795 | Number of Subarrays with Bounded Maximum | ✓ | ✓ | ✓ | Medium | | 794 | Valid Tic-Tac-Toe State | ✓ | ✓ | ✓ | Medium | | 793 | Preimage Size of Factorial Zeroes Function | ✓ | ✓ | ✓ | Hard | | 792 | Number of Matching Subsequences | ✓ | ✓ | ✓ | Medium | | 791 | Custom Sort String | ✓ | ✓ | ✓ | Medium | | 790 | Domino and Tromino Tiling | ✓ | ✓ | ✓ | Medium | | 789 | Escape The Ghosts | ✓ | ✓ | ✓ | Medium | | 788 | Rotated Digits | ✓ | ✓ | ✓ | Easy | | 787 | Cheapest Flights Within K Stops | ✓ | ✓ | ✓ | Medium | | 786 | K-th Smallest Prime Fraction | ✓ | ✓ | ✓ | Hard | | 785 | Is Graph Bipartite? | ✓ | ✓ | ✓ | Medium | | 784 | Letter Case Permutation | ✓ | ✓ | ✓ | Easy | | 783 | Minimum Distance Between BST Nodes | ✓ | ✓ | ✓ | Easy | | 782 | Transform to Chessboard | ✓ | ✓ | ✓ | Hard | | 781 | Rabbits in Forest | ✓ | ✓ | ✓ | Medium | | 780 | Reaching Points | ✓ | ✓ | ✓ | Hard | | 779 | K-th Symbol in Grammar | ✓ | ✓ | ✓ | Medium | | 778 | Swim in Rising Water | ✓ | ✓ | ✓ | Hard | | 777 | Swap Adjacent in LR String | ✓ | ✓ | ✓ | Medium | | 776 | | ✓ | ✓ | ✓ | Medium | | 775 | Global and Local Inversions | ✓ | ✓ | ✓ | Medium | | 774 | | ✓ | ✓ | ✓ | Hard | | 773 | Sliding Puzzle | ✓ | ✓ | ✓ | Hard | | 772 | | ✓ | ✓ | ✓ | Hard | | 771 | Jewels and Stones | ✓ | ✓ | ✓ | Easy | | 770 | Basic Calculator IV | ✓ | ✓ | ✓ | Hard | | 769 | Max Chunks To Make Sorted | ✓ | ✓ | ✓ | Medium | | 768 | Max Chunks To Make Sorted II | ✓ | ✓ | ✓ | Hard | | 767 | Reorganize String | ✓ | ✓ | ✓ | Medium | | 766 | Toeplitz Matrix | ✓ | ✓ | ✓ | Easy | | 765 | Couples Holding Hands | ✓ | ✓ | ✓ | Hard | | 764 | Largest Plus Sign | ✓ | ✓ | ✓ | Medium | | 763 | Partition Labels | ✓ | ✓ | ✓ | Medium | | 762 | Prime Number of Set Bits in Binary Representation | ✓ | ✓ | ✓ | Easy | | 761 | Special Binary String | ✓ | ✓ | ✓ | Hard | | 760 | | ✓ | ✓ | ✓ | Easy | | 759 | | ✓ | ✓ | ✓ | Hard | | 758 | | ✓ | ✓ | ✓ | Easy | | 757 | Set Intersection Size At Least Two | ✓ | ✓ | ✓ | Hard | | 756 | Pyramid Transition Matrix | ✓ | ✓ | ✓ | Medium | | 755 | | ✓ | ✓ | ✓ | Medium | | 754 | Reach a Number | ✓ | ✓ | ✓ | Easy | | 753 | Cracking the Safe | ✓ | ✓ | ✓ | Hard | | 752 | Open the Lock | ✓ | ✓ | ✓ | Medium | | 751 | | ✓ | ✓ | ✓ | Easy | | 750 | | ✓ | ✓ | ✓ | Medium | | 749 | Contain Virus | ✓ | ✓ | ✓ | Hard | | 748 | Shortest Completing Word | ✓ | ✓ | ✓ | Easy | | 747 | Largest Number At Least Twice of Others | ✓ | ✓ | ✓ | Easy | | 746 | Min Cost Climbing Stairs | ✓ | ✓ | ✓ | Easy | | 745 | Prefix and Suffix Search | ✓ | ✓ | ✓ | Hard | | 744 | Find Smallest Letter Greater Than Target | ✓ | ✓ | ✓ | Easy | | 743 | Network Delay Time | ✓ | ✓ | ✓ | Medium | | 742 | | ✓ | ✓ | ✓ | Medium | | 741 | Cherry Pickup | ✓ | ✓ | ✓ | Hard | | 740 | Delete and Earn | ✓ | ✓ | ✓ | Medium | | 739 | Daily Temperatures | ✓ | ✓ | ✓ | Medium | | 738 | Monotone Increasing Digits | ✓ | ✓ | ✓ | Medium | | 737 | | ✓ | ✓ | ✓ | Medium | | 736 | Parse Lisp Expression | ✓ | ✓ | ✓ | Medium | | 735 | Asteroid Collision | ✓ | ✓ | ✓ | Medium | | 734 | | ✓ | ✓ | ✓ | Easy | | 733 | Flood Fill | ✓ | ✓ | ✓ | Easy | | 732 | My Calendar III | ✓ | ✓ | ✓ | Hard | | 731 | My Calendar II | ✓ | ✓ | ✓ | Medium | | 730 | Count Different Palindromic Subsequences | ✓ | ✓ | ✓ | Hard | | 729 | My Calendar I | ✓ | ✓ | ✓ | Medium | | 728 | Self Dividing Numbers | ✓ | ✓ | ✓ | Easy | | 727 | | ✓ | ✓ | ✓ | Hard | | 726 | Number of Atoms | ✓ | ✓ | ✓ | Hard | | 725 | Split Linked List in Parts | ✓ | ✓ | ✓ | Medium | | 724 | Find Pivot Index | ✓ | ✓ | ✓ | Easy | | 723 | | ✓ | ✓ | ✓ | Medium | | 722 | Remove Comments | ✓ | ✓ | ✓ | Medium | | 721 | Accounts Merge | ✓ | ✓ | ✓ | Medium | | 720 | Longest Word in Dictionary | ✓ | ✓ | ✓ | Easy | | 719 | Find K-th Smallest Pair Distance | ✓ | ✓ | ✓ | Hard | | 718 | Maximum Length of Repeated Subarray | ✓ | ✓ | ✓ | Medium | | 717 | | ✓ | ✓ | ✓ | Easy | | 716 | | ✓ | ✓ | ✓ | Easy | | 715 | Range Module | ✓ | ✓ | ✓ | Hard | | 714 | Best Time to Buy and Sell Stock with Transaction Fee | ✓ | ✓ | ✓ | Medium | | 713 | Subarray Product Less Than K | ✓ | ✓ | ✓ | Medium | | 712 | Minimum ASCII Delete Sum for Two Strings | ✓ | ✓ | ✓ | Medium | | 711 | | ✓ | ✓ | ✓ | Hard | | 710 | Random Pick with Blacklist | ✓ | ✓ | ✓ | Hard | | 709 | To Lower Case | ✓ | ✓ | ✓ | Easy | | 708 | | ✓ | ✓ | ✓ | Medium | | 707 | Design Linked List | ✓ | ✓ | ✓ | Easy | | 706 | Design HashMap | ✓ | ✓ | ✓ | Easy | | 705 | Design HashSet | ✓ | ✓ | ✓ | Easy | | 704 | Binary Search | ✓ | ✓ | ✓ | Easy | | 703 | Kth Largest Element in a Stream | ✓ | ✓ | ✓ | Easy | | 702 | | ✓ | ✓ | ✓ | Medium | | 701 | Insert into a Binary Search Tree | ✓ | ✓ | ✓ | Medium | | 700 | Search in a Binary Search Tree | ✓ | ✓ | ✓ | Easy | | 699 | Falling Squares | ✓ | ✓ | ✓ | Hard | | 698 | Partition to K Equal Sum Subsets | ✓ | ✓ | ✓ | Medium | | 697 | Degree of an Array | ✓ | ✓ | ✓ | Easy | | 696 | Count Binary Substrings | ✓ | ✓ | ✓ | Easy | | 695 | Max Area of Island | ✓ | ✓ | ✓ | Medium | | 694 | | ✓ | ✓ | ✓ | Medium | | 693 | Binary Number with Alternating Bits | ✓ | ✓ | ✓ | Easy | | 692 | Top K Frequent Words | ✓ | ✓ | ✓ | Medium | | 691 | Stickers to Spell Word | ✓ | ✓ | ✓ | Hard | | 690 | Employee Importance | ✓ | ✓ | ✓ | Easy | | 689 | Maximum Sum of 3 Non-Overlapping Subarrays | ✓ | ✓ | ✓ | Hard | | 688 | Knight Probability in Chessboard | ✓ | ✓ | ✓ | Medium | | 687 | Longest Univalue Path | ✓ | ✓ | ✓ | Easy | | 686 | Repeated String Match | ✓ | ✓ | ✓ | Easy | | 685 | Redundant Connection II | ✓ | ✓ | ✓ | Hard | | 684 | Redundant Connection | ✓ | ✓ | ✓ | Medium | | 683 | | ✓ | ✓ | ✓ | Hard | | 682 | Baseball Game | ✓ | ✓ | ✓ | Easy | | 681 | | ✓ | ✓ | ✓ | Medium | | 680 | Valid Palindrome II | ✓ | ✓ | ✓ | Easy | | 679 | 24 Game | ✓ | ✓ | ✓ | Medium | | 678 | Valid Parenthesis String | ✓ | ✓ | ✓ | Medium | | 677 | Map Sum Pairs | ✓ | ✓ | ✓ | Medium | | 676 | Implement Magic Dictionary | ✓ | ✓ | ✓ | Medium | | 675 | Cut Off Trees for Golf Event | ✓ | ✓ | ✓ | Hard | | 674 | Longest Continuous Increasing Subsequence | ✓ | ✓ | ✓ | Easy | | 673 | Number of Longest Increasing Subsequence | ✓ | ✓ | ✓ | Medium | | 672 | Bulb Switcher II | ✓ | ✓ | ✓ | Medium | | 671 | Second Minimum Node In a Binary Tree | ✓ | ✓ | ✓ | Easy | | 670 | Maximum Swap | ✓ | ✓ | ✓ | Medium | | 669 | Trim a Binary Search Tree | ✓ | ✓ | ✓ | Easy | | 668 | Kth Smallest Number in Multiplication Table | ✓ | ✓ | ✓ | Hard | | 667 | Beautiful Arrangement II | ✓ | ✓ | ✓ | Medium | | 666 | | ✓ | ✓ | ✓ | Medium | | 665 | Non-decreasing Array | ✓ | ✓ | ✓ | Medium | | 664 | Strange Printer | ✓ | ✓ | ✓ | Medium | | 663 | | ✓ | ✓ | ✓ | Medium | | 662 | Maximum Width of Binary Tree | ✓ | ✓ | ✓ | Medium | | 661 | Image Smoother | ✓ | ✓ | ✓ | Easy | | 660 | | ✓ | ✓ | ✓ | Hard | | 659 | Split Array into Consecutive Subsequences | ✓ | ✓ | ✓ | Medium | | 658 | Find K Closest Elements | ✓ | ✓ | ✓ | Medium | | 657 | Robot Return to Origin | ✓ | ✓ | ✓ | Easy | | 656 | | ✓ | ✓ | ✓ | Hard | | 655 | Print Binary Tree | ✓ | ✓ | ✓ | Medium | | 654 | Maximum Binary Tree | ✓ | ✓ | ✓ | Medium | | 653 | Two Sum IV - Input is a BST | ✓ | ✓ | ✓ | Easy | | 652 | Find Duplicate Subtrees | ✓ | ✓ | ✓ | Medium | | 651 | | ✓ | ✓ | ✓ | Medium | | 650 | 2 Keys Keyboard | ✓ | ✓ | ✓ | Medium | | 649 | Dota2 Senate | ✓ | ✓ | ✓ | Medium | | 648 | Replace Words | ✓ | ✓ | ✓ | Medium | | 647 | Palindromic Substrings | ✓ | ✓ | ✓ | Medium | | 646 | Maximum Length of Pair Chain | ✓ | ✓ | ✓ | Medium | | 645 | Set Mismatch | ✓ | ✓ | ✓ | Easy | | 644 | | ✓ | ✓ | ✓ | Hard | | 643 | Maximum Average Subarray I | ✓ | ✓ | ✓ | Easy | | 642 | | ✓ | ✓ | ✓ | Hard | | 641 | Design Circular Deque | ✓ | ✓ | ✓ | Medium | | 640 | Solve the Equation | ✓ | ✓ | ✓ | Medium | | 639 | Decode Ways II | ✓ | ✓ | ✓ | Hard | | 638 | Shopping Offers | ✓ | ✓ | ✓ | Medium | | 637 | Average of Levels in Binary Tree | ✓ | ✓ | ✓ | Easy | | 636 | Exclusive Time of Functions | ✓ | ✓ | ✓ | Medium | | 635 | | ✓ | ✓ | ✓ | Medium | | 634 | | ✓ | ✓ | ✓ | Medium | | 633 | Sum of Square Numbers | ✓ | ✓ | ✓ | Easy | | 632 | Smallest Range | ✓ | ✓ | ✓ | Hard | | 631 | | ✓ | ✓ | ✓ | Hard | | 630 | Course Schedule III | ✓ | ✓ | ✓ | Hard | | 629 | K Inverse Pairs Array | ✓ | ✓ | ✓ | Hard | | 628 | Maximum Product of Three Numbers | ✓ | ✓ | ✓ | Easy | | 627 | Swap Salary | ✓ | ✓ | ✓ | Easy | | 626 | Exchange Seats | ✓ | ✓ | ✓ | Medium | | 625 | | ✓ | ✓ | ✓ | Medium | | 624 | | ✓ | ✓ | ✓ | Easy | | 623 | Add One Row to Tree | ✓ | ✓ | ✓ | Medium | | 622 | Design Circular Queue | ✓ | ✓ | ✓ | Medium | | 621 | Task Scheduler | ✓ | ✓ | ✓ | Medium | | 620 | Not Boring Movies | ✓ | ✓ | ✓ | Easy | | 619 | | ✓ | ✓ | ✓ | Easy | | 618 | | ✓ | ✓ | ✓ | Hard | | 617 | Merge Two Binary Trees | ✓ | ✓ | ✓ | Easy | | 616 | | ✓ | ✓ | ✓ | Medium | | 615 | | ✓ | ✓ | ✓ | Hard | | 614 | | ✓ | ✓ | ✓ | Medium | | 613 | | ✓ | ✓ | ✓ | Easy | | 612 | | ✓ | ✓ | ✓ | Medium | | 611 | Valid Triangle Number | ✓ | ✓ | ✓ | Medium | | 610 | | ✓ | ✓ | ✓ | Easy | | 609 | Find Duplicate File in System | ✓ | ✓ | ✓ | Medium | | 608 | | ✓ | ✓ | ✓ | Medium | | 607 | | ✓ | ✓ | ✓ | Easy | | 606 | Construct String from Binary Tree | ✓ | ✓ | ✓ | Easy | | 605 | Can Place Flowers | ✓ | ✓ | ✓ | Easy | | 604 | | ✓ | ✓ | ✓ | Easy | | 603 | | ✓ | ✓ | ✓ | Easy | | 602 | | ✓ | ✓ | ✓ | Medium | | 601 | Human Traffic of Stadium | ✓ | ✓ | ✓ | Hard | | 600 | Non-negative Integers without Consecutive Ones | ✓ | ✓ | ✓ | Hard | | 599 | Minimum Index Sum of Two Lists | ✓ | ✓ | ✓ | Easy | | 598 | Range Addition II | ✓ | ✓ | ✓ | Easy | | 597 | | ✓ | ✓ | ✓ | Easy | | 596 | Classes More Than 5 Students | ✓ | ✓ | ✓ | Easy | | 595 | Big Countries | ✓ | ✓ | ✓ | Easy | | 594 | Longest Harmonious Subsequence | ✓ | ✓ | ✓ | Easy | | 593 | Valid Square | ✓ | ✓ | ✓ | Medium | | 592 | Fraction Addition and Subtraction | ✓ | ✓ | ✓ | Medium | | 591 | Tag Validator | ✓ | ✓ | ✓ | Hard | | 590 | | ✓ | ✓ | ✓ | Easy | | 589 | | ✓ | ✓ | ✓ | Easy | | 588 | | ✓ | ✓ | ✓ | Hard | | 587 | Erect the Fence | ✓ | ✓ | ✓ | Hard | | 586 | | ✓ | ✓ | ✓ | Easy | | 585 | | ✓ | ✓ | ✓ | Medium | | 584 | | ✓ | ✓ | ✓ | Easy | | 583 | Delete Operation for Two Strings | ✓ | ✓ | ✓ | Medium | | 582 | | ✓ | ✓ | ✓ | Medium | | 581 | Shortest Unsorted Continuous Subarray | ✓ | ✓ | ✓ | Easy | | 580 | | ✓ | ✓ | ✓ | Medium | | 579 | | ✓ | ✓ | ✓ | Hard | | 578 | | ✓ | ✓ | ✓ | Medium | | 577 | Employee Bonus | ✓ | ✓ | ✓ | Easy | | 576 | Out of Boundary Paths | ✓ | ✓ | ✓ | Medium | | 575 | Distribute Candies | ✓ | ✓ | ✓ | Easy | | 574 | | ✓ | ✓ | ✓ | Medium | | 573 | | ✓ | ✓ | ✓ | Medium | | 572 | Subtree of Another Tree | ✓ | ✓ | ✓ | Easy | | 571 | | ✓ | ✓ | ✓ | Hard | | 570 | | ✓ | ✓ | ✓ | Medium | | 569 | | ✓ | ✓ | ✓ | Hard | | 568 | | ✓ | ✓ | ✓ | Hard | | 567 | Permutation in String | ✓ | ✓ | ✓ | Medium | | 566 | Reshape the Matrix | ✓ | ✓ | ✓ | Easy | | 565 | Array Nesting | ✓ | ✓ | ✓ | Medium | | 564 | Find the Closest Palindrome | ✓ | ✓ | ✓ | Hard | | 563 | Binary Tree Tilt | ✓ | ✓ | ✓ | Easy | | 562 | | ✓ | ✓ | ✓ | Medium | | 561 | Array Partition I | ✓ | ✓ | ✓ | Easy | | 560 | Subarray Sum Equals K | ✓ | ✓ | ✓ | Medium | | 559 | | ✓ | ✓ | ✓ | Easy | | 558 | | ✓ | ✓ | ✓ | Easy | | 557 | Reverse Words in a String III | ✓ | ✓ | ✓ | Easy | | 556 | Next Greater Element III | ✓ | ✓ | ✓ | Medium | | 555 | | ✓ | ✓ | ✓ | Medium | | 554 | Brick Wall | ✓ | ✓ | ✓ | Medium | | 553 | Optimal Division | ✓ | ✓ | ✓ | Medium | | 552 | Student Attendance Record II | ✓ | ✓ | ✓ | Hard | | 551 | Student Attendance Record I | ✓ | ✓ | ✓ | Easy | | 550 | | ✓ | ✓ | ✓ | Medium | | 549 | | ✓ | ✓ | ✓ | Medium | | 548 | | ✓ | ✓ | ✓ | Medium | | 547 | Friend Circles | ✓ | ✓ | ✓ | Medium | | 546 | Remove Boxes | ✓ | ✓ | ✓ | Hard | | 545 | | ✓ | ✓ | ✓ | Medium | | 544 | | ✓ | ✓ | ✓ | Medium | | 543 | Diameter of Binary Tree | ✓ | ✓ | ✓ | Easy | | 542 | 01 Matrix | ✓ | ✓ | ✓ | Medium | | 541 | Reverse String II | ✓ | ✓ | ✓ | Easy | | 540 | Single Element in a Sorted Array | ✓ | ✓ | ✓ | Medium | | 539 | Minimum Time Difference | ✓ | ✓ | ✓ | Medium | | 538 | Convert BST to Greater Tree | ✓ | ✓ | ✓ | Easy | | 537 | Complex Number Multiplication | ✓ | ✓ | ✓ | Medium | | 536 | | ✓ | ✓ | ✓ | Medium | | 535 | | ✓ | ✓ | ✓ | Medium | | 534 | | ✓ | ✓ | ✓ | Medium | | 533 | | ✓ | ✓ | ✓ | Medium | | 532 | K-diff Pairs in an Array | ✓ | ✓ | ✓ | Easy | | 531 | | ✓ | ✓ | ✓ | Medium | | 530 | Minimum Absolute Difference in BST | ✓ | ✓ | ✓ | Easy | | 529 | Minesweeper | ✓ | ✓ | ✓ | Medium | | 528 | Random Pick with Weight | ✓ | ✓ | ✓ | Medium | | 527 | | ✓ | ✓ | ✓ | Hard | | 526 | Beautiful Arrangement | ✓ | ✓ | ✓ | Medium | | 525 | Contiguous Array | ✓ | ✓ | ✓ | Medium | | 524 | Longest Word in Dictionary through Deleting | ✓ | ✓ | ✓ | Medium | | 523 | Continuous Subarray Sum | ✓ | ✓ | ✓ | Medium | | 522 | Longest Uncommon Subsequence II | ✓ | ✓ | ✓ | Medium | | 521 | Longest Uncommon Subsequence I | ✓ | ✓ | ✓ | Easy | | 520 | Detect Capital | ✓ | ✓ | ✓ | Easy | | 519 | Random Flip Matrix | ✓ | ✓ | ✓ | Medium | | 518 | Coin Change 2 | ✓ | ✓ | ✓ | Medium | | 517 | Super Washing Machines | ✓ | ✓ | ✓ | Hard | | 516 | Longest Palindromic | ✓ | ✓ | ✓ | Medium | | 515 | Find Largest Value in Each Tree Row | ✓ | ✓ | ✓ | Medium | | 514 | Freedom Trail | ✓ | ✓ | ✓ | Hard | | 513 | Find Bottom Left Tree Value | ✓ | ✓ | ✓ | Medium | | 512 | | ✓ | ✓ | ✓ | Medium | | 511 | | ✓ | ✓ | ✓ | Medium | | 510 | | ✓ | ✓ | ✓ | Medium | | 509 | Fibonacci Number | ✓ | ✓ | ✓ | Easy | | 508 | Most Frequent Subtree Sum | ✓ | ✓ | ✓ | Medium | | 507 | Perfect Number | ✓ | ✓ | ✓ | Easy | | 506 | Relative Ranks | ✓ | ✓ | ✓ | Easy | | 505 | | ✓ | ✓ | ✓ | Medium | | 504 | Base 7 | ✓ | ✓ | ✓ | Easy | | 503 | Next Greater Element II | ✓ | ✓ | ✓ | Medium | | 502 | Initial Public Offerings | ✓ | ✓ | ✓ | Hard | | 501 | Find Mode in Binary Search Tree | ✓ | ✓ | ✓ | Easy | | 500 | Keyboard Row | ✓ | ✓ | ✓ | Easy | | 499 | | ✓ | ✓ | ✓ | Hard | | 498 | Diagonal Traverse | ✓ | ✓ | ✓ | Medium | | 497 | [Random Point in Non | ✓ | ✓ | ✓ | Medium | | 496 | Next Greater Element I | ✓ | ✓ | ✓ | Easy | | 495 | Teemo Attacking | ✓ | ✓ | ✓ | Medium | | 494 | Target Sum | ✓ | ✓ | ✓ | Medium | | 493 | Reverse Pairs | ✓ | ✓ | ✓ | Hard | | 492 | Construct the Rectangle | ✓ | ✓ | ✓ | Easy | | 491 | Increasing Subsequences | ✓ | ✓ | ✓ | Medium | | 490 | | ✓ | ✓ | ✓ | Medium | | 489 | | ✓ | ✓ | ✓ | Hard | | 488 | Zuma Game | ✓ | ✓ | ✓ | Hard | | 487 | | ✓ | ✓ | ✓ | Medium | | 486 | Predict the Winner | ✓ | ✓ | ✓ | Medium | | 485 | Max Consecutive Ones | ✓ | ✓ | ✓ | Easy | | 484 | | ✓ | ✓ | ✓ | Medium | | 483 | Smallest Good Base | ✓ | ✓ | ✓ | Hard | | 482 | License Key Formatting | ✓ | ✓ | ✓ | Easy | | 481 | Magical String | ✓ | ✓ | ✓ | Medium | | 480 | Sliding Window Median | ✓ | ✓ | ✓ | Hard | | 479 | Largest Palindrome Product | ✓ | ✓ | ✓ | Hard | | 478 | Generate Random Point in a Circle | ✓ | ✓ | ✓ | Medium | | 477 | Total Hamming Distance | ✓ | ✓ | ✓ | Medium | | 476 | Number Complement | ✓ | ✓ | ✓ | Easy | | 475 | Heaters | ✓ | ✓ | ✓ | Easy | | 474 | Ones and Zeroes | ✓ | ✓ | ✓ | Medium | | 473 | Matchsticks to Square | ✓ | ✓ | ✓ | Medium | | 472 | Concatenated Words | ✓ | ✓ | ✓ | Hard | | 471 | | ✓ | ✓ | ✓ | Hard | | 470 | Implement Rand10() Using Rand7() | ✓ | ✓ | ✓ | Medium | | 469 | | ✓ | ✓ | ✓ | Medium | | 468 | Validate IP Address | ✓ | ✓ | ✓ | Medium | | 467 | Unique Substrings in Wraparound String | ✓ | ✓ | ✓ | Medium | | 466 | Count The Repetitions | ✓ | ✓ | ✓ | Hard | | 465 | | ✓ | ✓ | ✓ | Hard | | 464 | Can I Win | ✓ | ✓ | ✓ | Medium | | 463 | Island Perimeter | ✓ | ✓ | ✓ | Easy | | 462 | Minimum Moves to Equal Array Elements II | ✓ | ✓ | ✓ | Medium | | 461 | Hamming Distance | ✓ | ✓ | ✓ | Easy | | 460 | LFU Cache | ✓ | ✓ | ✓ | Hard | | 459 | Repeated Substring Pattern | ✓ | ✓ | ✓ | Easy | | 458 | Poor Pigs | ✓ | ✓ | ✓ | Hard | | 457 | Circular Array Loop | ✓ | ✓ | ✓ | Medium | | 456 | 132 Pattern | ✓ | ✓ | ✓ | Medium | | 455 | Assign Cookies | ✓ | ✓ | ✓ | Easy | | 454 | 4Sum II | ✓ | ✓ | ✓ | Medium | | 453 | Minimum Moves to Equal Array Elements | ✓ | ✓ | ✓ | Easy | | 452 | Minimum Number of Arrows to Burst Balloons | ✓ | ✓ | ✓ | Medium | | 451 | Sort Characters By Frequency | ✓ | ✓ | ✓ | Medium | | 450 | Delete Node in a BST | ✓ | ✓ | ✓ | Medium | | 449 | | ✓ | ✓ | ✓ | Medium | | 448 | Find All Numbers Disappeared in an Array | ✓ | ✓ | ✓ | Easy | | 447 | Number of Boomerangs | ✓ | ✓ | ✓ | Easy | | 446 | Arithmetic Slices II - Subsequence | ✓ | ✓ | ✓ | Hard | | 445 | Add Two Numbers II | ✓ | ✓ | ✓ | Medium | | 444 | | ✓ | ✓ | ✓ | Medium | | 443 | String Compression | ✓ | ✓ | ✓ | Easy | | 442 | Find All Duplicates in an Array | ✓ | ✓ | ✓ | Medium | | 441 | Arranging Coins | ✓ | ✓ | ✓ | Easy | | 440 | K-th Smallest in Lexicographical Order | ✓ | ✓ | ✓ | Hard | | 439 | | ✓ | ✓ | ✓ | Medium | | 438 | Find All Anagrams in a String | ✓ | ✓ | ✓ | Easy | | 437 | Path Sum III | ✓ | ✓ | ✓ | Easy | | 436 | Find Right Interval | ✓ | ✓ | ✓ | Medium | | 435 | Non-overlapping Intervals | ✓ | ✓ | ✓ | Medium | | 434 | Number of Segments in a String | ✓ | ✓ | ✓ | Easy | | 433 | Minimum Genetic Mutation | ✓ | ✓ | ✓ | Medium | | 432 | All O`one Data Structure | ✓ | ✓ | ✓ | Hard | | 431 | | ✓ | ✓ | ✓ | Hard | | 430 | | ✓ | ✓ | ✓ | Medium | | 429 | | ✓ | ✓ | ✓ | Easy | | 428 | | ✓ | ✓ | ✓ | Hard | | 427 | | ✓ | ✓ | ✓ | Easy | | 426 | | ✓ | ✓ | ✓ | Medium | | 425 | | ✓ | ✓ | ✓ | Hard | | 424 | Longest Repeating Character Replacement | ✓ | ✓ | ✓ | Medium | | 423 | Reconstruct Original Digits from English | ✓ | ✓ | ✓ | Medium | | 422 | | ✓ | ✓ | ✓ | Easy | | 421 | Maximum XOR of Two Numbers in an Array | ✓ | ✓ | ✓ | Medium | | 420 | Strong Password Checker | ✓ | ✓ | ✓ | Hard | | 419 | Battleships in a Board | ✓ | ✓ | ✓ | Medium | | 418 | | ✓ | ✓ | ✓ | Medium | | 417 | Pacific Atlantic Water Flow | ✓ | ✓ | ✓ | Medium | | 416 | Partition Equal Subset Sum | ✓ | ✓ | ✓ | Medium | | 415 | Add Strings | ✓ | ✓ | ✓ | Easy | | 414 | Third Maximum Number | ✓ | ✓ | ✓ | Easy | | 413 | Arithmetic Slices | ✓ | ✓ | ✓ | Medium | | 412 | Fizz Buzz | ✓ | ✓ | ✓ | Easy | | 411 | | ✓ | ✓ | ✓ | Hard | | 410 | Split Array Largest Sum | ✓ | ✓ | ✓ | Hard | | 409 | Longest Palindrome | ✓ | ✓ | ✓ | Easy | | 408 | | ✓ | ✓ | ✓ | Easy | | 407 | Trapping Rain Water II | ✓ | ✓ | ✓ | Hard | | 406 | Queue Reconstruction by Height | ✓ | ✓ | ✓ | Medium | | 405 | Convert a Number to Hexadecimal | ✓ | ✓ | ✓ | Easy | | 404 | Sum of Left Leaves | ✓ | ✓ | ✓ | Easy | | 403 | Frog Jump | ✓ | ✓ | ✓ | Hard | | 402 | Remove K Digits | ✓ | ✓ | ✓ | Medium | | 401 | Binary Watch | ✓ | ✓ | ✓ | Easy | | 400 | Nth Digit | ✓ | ✓ | ✓ | Easy | | 399 | Evaluate Division | ✓ | ✓ | ✓ | Medium | | 398 | Random Pick Index | ✓ | ✓ | ✓ | Medium | | 397 | Integer Replacement | ✓ | ✓ | ✓ | Medium | | 396 | Rotate Function | ✓ | ✓ | ✓ | Medium | | 395 | Longest Substring with At Least K Repeating Characters | ✓ | ✓ | ✓ | Medium | | 394 | Decode String | ✓ | ✓ | ✓ | Medium | | 393 | UTF-8 Validation | ✓ | ✓ | ✓ | Medium | | 392 | Is Subsequence | ✓ | ✓ | ✓ | Medium | | 391 | Perfect Rectangle | ✓ | ✓ | ✓ | Hard | | 390 | Elimination Game | ✓ | ✓ | ✓ | Medium | | 389 | Find the Difference | ✓ | ✓ | ✓ | Easy | | 388 | Longest Absolute File Path | ✓ | ✓ | ✓ | Medium | | 387 | First Unique Character in a String | ✓ | ✓ | ✓ | Easy | | 386 | Lexicographical Numbers | ✓ | ✓ | ✓ | Medium | | 385 | Mini Parser | ✓ | ✓ | ✓ | Medium | | 384 | Shuffle an Array | ✓ | ✓ | ✓ | Medium | | 383 | Ransom Note | ✓ | ✓ | ✓ | Easy | | 382 | Linked List Random Node | ✓ | ✓ | ✓ | Medium | | 381 | Insert Delete GetRandom O(1) - Duplicates allowed | ✓ | ✓ | ✓ | Hard | | 380 | Insert Delete GetRandom O(1) | ✓ | ✓ | ✓ | Medium | | 379 | | ✓ | ✓ | ✓ | Medium | | 378 | Kth Smallest Element in a Sorted Matrix | ✓ | ✓ | ✓ | Medium | | 377 | Combination Sum IV | ✓ | ✓ | ✓ | Medium | | 376 | Wiggle Subsequence | ✓ | ✓ | ✓ | Medium | | 375 | Guess Number Higher or Lower II | ✓ | ✓ | ✓ | Medium | | 374 | Guess Number Higher or Lower | ✓ | ✓ | ✓ | Easy | | 373 | Find K Pairs with Smallest Sums | ✓ | ✓ | ✓ | Medium | | 372 | Super Pow | ✓ | ✓ | ✓ | Medium | | 371 | Sum of Two Integers | ✓ | ✓ | ✓ | Easy | | 370 | | ✓ | ✓ | ✓ | Medium | | 369 | | ✓ | ✓ | ✓ | Medium | | 368 | Largest Divisible Subset | ✓ | ✓ | ✓ | Medium | | 367 | Valid Perfect Square | ✓ | ✓ | ✓ | Easy | | 366 | | ✓ | ✓ | ✓ | Medium | | 365 | Water and Jug Problem | ✓ | ✓ | ✓ | Medium | | 364 | | ✓ | ✓ | ✓ | Medium | | 363 | Max Sum of Rectangle No Larger Than K | ✓ | ✓ | ✓ | Hard | | 362 | | ✓ | ✓ | ✓ | Medium | | 361 | | ✓ | ✓ | ✓ | Medium | | 360 | | ✓ | ✓ | ✓ | Medium | | 359 | | ✓ | ✓ | ✓ | Easy | | 358 | | ✓ | ✓ | ✓ | Hard | | 357 | Count Numbers with Unique Digits | ✓ | ✓ | ✓ | Medium | | 356 | | ✓ | ✓ | ✓ | Medium | | 355 | | ✓ | ✓ | ✓ | Medium | | 354 | Russian Doll Envelopes | ✓ | ✓ | ✓ | Hard | | 353 | | ✓ | ✓ | ✓ | Medium | | 352 | Data Stream as Disjoint Intervals | ✓ | ✓ | ✓ | Hard | | 351 | Android Unlock Patterns $ | ✓ | ✓ | ✓ | Medium | | 350 | Intersection of Two Arrays II | ✓ | ✓ | ✓ | Easy | | 349 | Intersection of Two Arrays | ✓ | ✓ | ✓ | Easy | | 348 | Design Tic-Tac-Toe $ | ✓ | ✓ | ✓ | Medium | | 347 | Top K Frequent Elements | ✓ | ✓ | ✓ | Medium | | 346 | Moving Average from Data Stream $ | ✓ | ✓ | ✓ | Easy | | 345 | Reverse Vowels of a String | ✓ | ✓ | ✓ | Easy | | 344 | Reverse String | ✓ | ✓ | ✓ | Easy | | 343 | Integer Break | ✓ | ✓ | ✓ | Medium | | 342 | Power of Four | ✓ | ✓ | ✓ | Easy | | 341 | Flatten Nested List Iterator | ✓ | ✓ | ✓ | Medium | | 340 | Longest Substring with At Most K Distinct Characters $ | ✓ | ✓ | ✓ | Hard | | 339 | Nested List Weight Sum $ | ✓ | ✓ | ✓ | Easy | | 338 | Counting Bits | ✓ | ✓ | ✓ | Medium | | 337 | House Robber III | ✓ | ✓ | ✓ | Medium | | 336 | Palindrome Pairs | ✓ | ✓ | ✓ | Hard | | 335 | Self Crossing | ✓ | ✓ | ✓ | Hard | | 334 | Increasing Triplet Subsequence | ✓ | ✓ | ✓ | Medium | | 333 | Largest BST Subtree $ | ✓ | ✓ | ✓ | Medium | | 332 | Reconstruct Itinerary | ✓ | ✓ | ✓ | Medium | | 331 | Verify Preorder Serialization of a Binary Tree | ✓ | ✓ | ✓ | Medium | | 330 | Patching Array | ✓ | ✓ | ✓ | Hard | | 329 | Longest Increasing Path in a Matrix | ✓ | ✓ | ✓ | Hard | | 328 | Odd Even Linked List | ✓ | ✓ | ✓ | Medium | | 327 | Count of Range Sum | ✓ | ✓ | ✓ | Hard | | 326 | Power of Three | ✓ | ✓ | ✓ | Easy | | 325 | Maximum Size Subarray Sum Equals k $ | ✓ | ✓ | ✓ | Medium | | 324 | Wiggle Sort II | ✓ | ✓ | ✓ | Medium | | 323 | Number of Connected Components in an Undirected Graph $ | ✓ | ✓ | ✓ | Medium | | 322 | Coin Change | ✓ | ✓ | ✓ | Medium | | 321 | Create Maximum Number | ✓ | ✓ | ✓ | Hard | | 320 | Generalized Abbreviation $ | ✓ | ✓ | ✓ | Medium | | 319 | Bulb Switcher | ✓ | ✓ | ✓ | Medium | | 318 | Maximum Product of Word Lengths | ✓ | ✓ | ✓ | Medium | | 317 | Shortest Distance from All Buildings $ | ✓ | ✓ | ✓ | Hard | | 316 | Remove Duplicate Letters | ✓ | ✓ | ✓ | Hard | | 315 | Count of Smaller Numbers After Self | ✓ | ✓ | ✓ | Hard | | 314 | Binary Tree Vertical Order Traversal $ | ✓ | ✓ | ✓ | Medium | | 313 | Super Ugly Number | ✓ | ✓ | ✓ | Medium | | 312 | Burst Balloons | ✓ | ✓ | ✓ | Hard | | 311 | Sparse Matrix Multiplication $ | ✓ | ✓ | ✓ | Medium | | 310 | Minimum Height Trees | ✓ | ✓ | ✓ | Medium | | 309 | Best Time to Buy and Sell Stock with Cooldown | ✓ | ✓ | ✓ | Medium | | 308 | Range Sum Query 2D - Mutable | ✓ | ✓ | ✓ | Hard | | 307 | Range Sum Query - Mutable | ✓ | ✓ | ✓ | Medium | | 306 | Additive Number | ✓ | ✓ | ✓ | Medium | | 305 | Number of Islands II $ | ✓ | ✓ | ✓ | Hard | | 304 | Range Sum Query 2D - Immutable | ✓ | ✓ | ✓ | Medium | | 303 | Range Sum Query - Immutable | ✓ | ✓ | ✓ | Easy | | 302 | Smallest Rectangle Enclosing Black Pixels $ | ✓ | ✓ | ✓ | Hard | | 301 | Remove Invalid Parentheses | ✓ | ✓ | ✓ | Hard | | 300 | Longest Increasing Subsequence | ✓ | ✓ | ✓ | Medium | | 299 | Bulls and Cows | ✓ | ✓ | ✓ | Medium | | 298 | Binary Tree Longest Consecutive Sequence $ | ✓ | ✓ | ✓ | Medium | | 297 | Serialize and Deserialize Binary Tree | ✓ | ✓ | ✓ | Hard | | 296 | Best Meeting Point $ | ✓ | ✓ | ✓ | Hard | | 295 | Find Median from Data Stream | ✓ | ✓ | ✓ | Hard | | 294 | Flip Game II $ | ✓ | ✓ | ✓ | Medium | | 293 | Flip Game $ | ✓ | ✓ | ✓ | Easy | | 292 | Nim Game | ✓ | ✓ | ✓ | Easy | | 291 | Word Pattern II $ | ✓ | ✓ | ✓ | Hard | | 290 | Word Pattern | ✓ | ✓ | ✓ | Easy | | 289 | Game of Life | ✓ | ✓ | ✓ | Medium | | 288 | Unique Word Abbreviation $ | ✓ | ✓ | ✓ | Medium | | 287 | Find the Duplicate Number | ✓ | ✓ | ✓ | Medium | | 286 | Walls and Gates $ | ✓ | ✓ | ✓ | Medium | | 285 | Inorder Successor in BST $ | ✓ | ✓ | ✓ | Medium | | 284 | Peeking Iterator | ✓ | ✓ | ✓ | Medium | | 283 | Move Zeroes | ✓ | ✓ | ✓ | Easy | | 282 | Expression Add Operators | ✓ | ✓ | ✓ | Hard | | 281 | Zigzag Iterator $ | ✓ | ✓ | ✓ | Medium | | 280 | Wiggle Sort | ✓ | ✓ | ✓ | Medium | | 279 | Perfect Squares | ✓ | ✓ | ✓ | Medium | | 278 | First Bad Version | ✓ | ✓ | ✓ | Easy | | 277 | Find the Celebrity $ | ✓ | ✓ | ✓ | Medium | | 276 | Paint Fence $ | ✓ | ✓ | ✓ | Easy | | 275 | H-Index II | ✓ | ✓ | ✓ | Medium | | 274 | H-Index | ✓ | ✓ | ✓ | Medium | | 273 | Integer to English Words | ✓ | ✓ | ✓ | Hard | | 272 | Closest Binary Search Tree Value II $ | ✓ | ✓ | ✓ | Hard | | 271 | Encode and Decode Strings $ | ✓ | ✓ | ✓ | Medium | | 270 | Closest Binary Search Tree Value $ | ✓ | ✓ | ✓ | Easy | | 269 | Alien Dictionary $ | ✓ | ✓ | ✓ | Hard | | 268 | Missing Number | ✓ | ✓ | ✓ | Easy | | 267 | Palindrome Permutation II $ | ✓ | ✓ | ✓ | Medium | | 266 | Palindrome Permutation $ | ✓ | ✓ | ✓ | Easy | | 265 | Paint House II $ | ✓ | ✓ | ✓ | Hard | | 264 | Ugly Number II | ✓ | ✓ | ✓ | Medium | | 263 | Ugly Number | ✓ | ✓ | ✓ | Easy | | 262 | Trips and Users | ✓ | ✓ | ✓ | Hard | | 261 | Graph Valid Tree $ | ✓ | ✓ | ✓ | Medium | | 260 | Single Number III | ✓ | ✓ | ✓ | Medium | | 259 | 3Sum Smaller $ | ✓ | ✓ | ✓ | Medium | | 258 | Add Digits | ✓ | ✓ | ✓ | Easy | | 257 | Binary Tree Paths | ✓ | ✓ | ✓ | Easy | | 256 | Paint House $ | ✓ | ✓ | ✓ | Easy | | 255 | Verify Preorder Sequence in Binary Search Tree $ | ✓ | ✓ | ✓ | Medium | | 254 | Factor Combinations $ | ✓ | ✓ | ✓ | Medium | | 253 | Meeting Rooms II $ | ✓ | ✓ | ✓ | Medium | | 252 | Meeting Rooms $ | ✓ | ✓ | ✓ | Easy | | 251 | Flatten 2D Vector $ | ✓ | ✓ | ✓ | Medium | | 250 | Count Univalue Subtrees $ | ✓ | ✓ | ✓ | Medium | | 249 | Group Shifted Strings $ | ✓ | ✓ | ✓ | Medium | | 248 | Strobogrammatic Number III $ | ✓ | ✓ | ✓ | Hard | | 247 | Strobogrammatic Number II $ | ✓ | ✓ | ✓ | Medium | | 246 | Strobogrammatic Number $ | ✓ | ✓ | ✓ | Easy | | 245 | Shortest Word Distance III $ | ✓ | ✓ | ✓ | Medium | | 244 | Shortest Word Distance II $ | ✓ | ✓ | ✓ | Medium | | 243 | Shortest Word Distance $ | ✓ | ✓ | ✓ | Easy | | 242 | Valid Anagram | ✓ | ✓ | ✓ | Easy | | 241 | Different Ways to Add Parentheses | ✓ | ✓ | ✓ | Medium | | 240 | Search a 2D Matrix II | ✓ | ✓ | ✓ | Medium | | 239 | Sliding Window Maximum | ✓ | ✓ | ✓ | Hard | | 238 | Product of Array Except Self | ✓ | ✓ | ✓ | Medium | | 237 | Delete Node in a Linked List | ✓ | ✓ | ✓ | Easy | | 236 | Lowest Common Ancestor of a Binary Tree | ✓ | ✓ | ✓ | Medium | | 235 | Lowest Common Ancestor of a Binary Search Tree | ✓ | ✓ | ✓ | Easy | | 234 | Palindrome Linked List | ✓ | ✓ | ✓ | Easy | | 233 | Number of Digit One | ✓ | ✓ | ✓ | Hard | | 232 | Implement Queue using Stacks | ✓ | ✓ | ✓ | Easy | | 231 | Power of Two | ✓ | ✓ | ✓ | Easy | | 230 | Kth Smallest Element in a BST | ✓ | ✓ | ✓ | Medium | | 229 | Majority Element II | ✓ | ✓ | ✓ | Medium | | 228 | Summary Ranges | ✓ | ✓ | ✓ | Medium | | 227 | Basic Calculator II | ✓ | ✓ | ✓ | Medium | | 226 | Invert Binary Tree | ✓ | ✓ | ✓ | Easy | | 225 | Implement Stack using Queues | ✓ | ✓ | ✓ | Easy | | 224 | Basic Calculator | ✓ | ✓ | ✓ | Hard | | 223 | Rectangle Area | ✓ | ✓ | ✓ | Medium | | 222 | Count Complete Tree Nodes | ✓ | ✓ | ✓ | Medium | | 221 | Maximal Square | ✓ | ✓ | ✓ | Medium | | 220 | Contains Duplicate III | ✓ | ✓ | ✓ | Medium | | 219 | Contains Duplicate II | ✓ | ✓ | ✓ | Easy | | 218 | The Skyline Problem | ✓ | ✓ | ✓ | Hard | | 217 | Contains Duplicate | ✓ | ✓ | ✓ | Easy | | 216 | Combination Sum III | ✓ | ✓ | ✓ | Medium | | 215 | Kth Largest Element in an Array | ✓ | ✓ | ✓ | Medium | | 214 | Shortest Palindrome | ✓ | ✓ | ✓ | Hard | | 213 | House Robber II | ✓ | ✓ | ✓ | Medium | | 212 | Word Search II | ✓ | ✓ | ✓ | Hard | | 211 | Add and Search Word - Data structure design | ✓ | ✓ | ✓ | Medium | | 210 | Course Schedule II | ✓ | ✓ | ✓ | Medium | | 209 | Minimum Size Subarray Sum | ✓ | ✓ | ✓ | Medium | | 208 | Implement Trie (Prefix Tree) | ✓ | ✓ | ✓ | Medium | | 207 | Course Schedule | ✓ | ✓ | ✓ | Medium | | 206 | Reverse Linked List | ✓ | ✓ | ✓ | Easy | | 205 | Isomorphic Strings | ✓ | ✓ | ✓ | Easy | | 204 | Count Primes | ✓ | ✓ | ✓ | Easy | | 203 | Remove Linked List Elements | ✓ | ✓ | ✓ | Easy | | 202 | Happy Number | ✓ | ✓ | ✓ | Easy | | 201 | Bitwise AND of Numbers Range | ✓ | ✓ | ✓ | Medium | | 200 | Number of Islands | ✓ | ✓ | ✓ | Medium | | 199 | Binary Tree Right Side View | ✓ | ✓ | ✓ | Medium | | 198 | House Robber | ✓ | ✓ | ✓ | Easy | | 197 | Rising Temperature | ✓ | ✓ | ✓ | Easy | | 196 | Delete Duplicate Emails | ✓ | ✓ | ✓ | Easy | | 195 | Tenth Line | ✓ | ✓ | ✓ | Easy | | 194 | Transpose File | ✓ | ✓ | ✓ | Medium | | 193 | Valid Phone Numbers | ✓ | ✓ | ✓ | Easy | | 192 | Word Frequency | ✓ | ✓ | ✓ | Medium | | 191 | Number of 1 Bits | ✓ | ✓ | ✓ | Easy | | 190 | Reverse Bits | ✓ | ✓ | ✓ | Easy | | 189 | Rotate Array | ✓ | ✓ | ✓ | Easy | | 188 | Best Time to Buy and Sell Stock IV | ✓ | ✓ | ✓ | Hard | | 187 | Repeated DNA Sequences | ✓ | ✓ | ✓ | Medium | | 186 | Reverse Words in a String II $ | ✓ | ✓ | ✓ | Medium | | 185 | Department Top Three Salaries | ✓ | ✓ | ✓ | Hard | | 184 | Department Highest Salary | ✓ | ✓ | ✓ | Medium | | 183 | Customers Who Never Order | ✓ | ✓ | ✓ | Easy | | 182 | Duplicate Emails | ✓ | ✓ | ✓ | Easy | | 181 | Employees Earning More Than Their Managers | ✓ | ✓ | ✓ | Easy | | 180 | Consecutive Numbers | ✓ | ✓ | ✓ | Medium | | 179 | Largest Number | ✓ | ✓ | ✓ | Medium | | 178 | Rank Scores | ✓ | ✓ | ✓ | Medium | | 177 | Nth Highest Salary | ✓ | ✓ | ✓ | Medium | | 176 | Second Highest Salary | ✓ | ✓ | ✓ | Easy | | 175 | Combine Two Tables | ✓ | ✓ | ✓ | Easy | | 174 | Dungeon Game | ✓ | ✓ | ✓ | Hard | | 173 | Binary Search Tree Iterator | ✓ | ✓ | ✓ | Medium | | 172 | Factorial Trailing Zeroes | ✓ | ✓ | ✓ | Easy | | 171 | Excel Sheet Column Number | ✓ | ✓ | ✓ | Easy | | 170 | Two Sum III - Data structure design $ | ✓ | ✓ | ✓ | Easy | | 169 | Majority Element | ✓ | ✓ | ✓ | Easy | | 168 | Excel Sheet Column Title | ✓ | ✓ | ✓ | Easy | | 167 | Two Sum II - Input array is sorted | ✓ | ✓ | ✓ | Easy | | 166 | Fraction to Recurring Decimal | ✓ | ✓ | ✓ | Medium | | 165 | Compare Version Numbers | ✓ | ✓ | ✓ | Medium | | 164 | Maximum Gap | ✓ | ✓ | ✓ | Hard | | 163 | Missing Ranges $ | ✓ | ✓ | ✓ | Medium | | 162 | Find Peak Element | ✓ | ✓ | ✓ | Medium | | 161 | One Edit Distance $ | ✓ | ✓ | ✓ | Medium | | 160 | Intersection of Two Linked Lists | ✓ | ✓ | ✓ | Easy | | 159 | Longest Substring with At Most Two Distinct Characters $ | ✓ | ✓ | ✓ | Hard | | 158 | Read N Characters Given Read4 II $ | ✓ | ✓ | ✓ | Hard | | 157 | Read N Characters Given Read4 $ | ✓ | ✓ | ✓ | Easy | | 156 | Binary Tree Upside Down $ | ✓ | ✓ | ✓ | Medium | | 155 | Min Stack | ✓ | ✓ | ✓ | Easy | | 154 | Find Minimum in Rotated Sorted Array II | ✓ | ✓ | ✓ | Hard | | 153 | Find Minimum in Rotated Sorted Array | ✓ | ✓ | ✓ | Medium | | 152 | Maximum Product Subarray | ✓ | ✓ | ✓ | Medium | | 151 | Reverse Words in a String | ✓ | ✓ | ✓ | Medium | | 150 | Evaluate Reverse Polish Notation | ✓ | ✓ | ✓ | Medium | | 149 | Max Points on a Line | ✓ | ✓ | ✓ | Hard | | 148 | Sort List | ✓ | ✓ | ✓ | Medium | | 147 | Insertion Sort List | ✓ | ✓ | ✓ | Medium | | 146 | LRU Cache | ✓ | ✓ | ✓ | Hard | | 145 | Binary Tree Postorder Traversal | ✓ | ✓ | ✓ | Hard | | 144 | Binary Tree Preorder Traversal | ✓ | ✓ | ✓ | Medium | | 143 | Reorder List | ✓ | ✓ | ✓ | Medium | | 142 | Linked List Cycle II | ✓ | ✓ | ✓ | Medium | | 141 | Linked List Cycle | ✓ | ✓ | ✓ | Easy | | 140 | Word Break II | ✓ | ✓ | ✓ | Hard | | 139 | Word Break | ✓ | ✓ | ✓ | Medium | | 138 | Copy List with Random Pointer | ✓ | ✓ | ✓ | Medium | | 137 | Single Number II | ✓ | ✓ | ✓ | Medium | | 136 | Single Number | ✓ | ✓ | ✓ | Easy | | 135 | Candy | ✓ | ✓ | ✓ | Hard | | 134 | Gas Station | ✓ | ✓ | ✓ | Medium | | 133 | Clone Graph | ✓ | ✓ | ✓ | Medium | | 132 | Palindrome Partitioning II | ✓ | ✓ | ✓ | Hard | | 131 | Palindrome Partitioning | ✓ | ✓ | ✓ | Medium | | 130 | Surrounded Regions | ✓ | ✓ | ✓ | Medium | | 129 | Sum Root to Leaf Numbers | ✓ | ✓ | ✓ | Medium | | 128 | Longest Consecutive Sequence | ✓ | ✓ | ✓ | Hard | | 127 | Word Ladder | ✓ | ✓ | ✓ | Medium | | 126 | Word Ladder II | ✓ | ✓ | ✓ | Hard | | 125 | Valid Palindrome | ✓ | ✓ | ✓ | Easy | | 124 | Binary Tree Maximum Path Sum | ✓ | ✓ | ✓ | Hard | | 123 | Best Time to Buy and Sell Stock III | ✓ | ✓ | ✓ | Hard | | 122 | Best Time to Buy and Sell Stock II | ✓ | ✓ | ✓ | Easy | | 121 | Best Time to Buy and Sell Stock | ✓ | ✓ | ✓ | Easy | | 120 | Triangle | ✓ | ✓ | ✓ | Medium | | 119 | Pascal's Triangle II | ✓ | ✓ | ✓ | Easy | | 118 | Pascal's Triangle | ✓ | ✓ | ✓ | Easy | | 117 | Populating Next Right Pointers in Each Node II | ✓ | ✓ | ✓ | Medium | | 116 | Populating Next Right Pointers in Each Node | ✓ | ✓ | ✓ | Medium | | 115 | Distinct Subsequences | ✓ | ✓ | ✓ | Hard | | 114 | Flatten Binary Tree to Linked List | ✓ | ✓ | ✓ | Medium | | 113 | Path Sum II | ✓ | ✓ | ✓ | Medium | | 112 | Path Sum | ✓ | ✓ | ✓ | Easy | | 111 | Minimum Depth of Binary Tree | ✓ | ✓ | ✓ | Easy | | 110 | Balanced Binary Tree | ✓ | ✓ | ✓ | Easy | | 109 | Convert Sorted List to Binary Search Tree | ✓ | ✓ | ✓ | Medium | | 108 | Convert Sorted Array to Binary Search Tree | ✓ | ✓ | ✓ | Easy | | 107 | Binary Tree Level Order Traversal II | ✓ | ✓ | ✓ | Easy | | 106 | Construct Binary Tree from Inorder and Postorder Traversal | ✓ | ✓ | ✓ | Medium | | 105 | Construct Binary Tree from Preorder and Inorder Traversal | ✓ | ✓ | ✓ | Medium | | 104 | Maximum Depth of Binary Tree | ✓ | ✓ | ✓ | Easy | | 103 | Binary Tree Zigzag Level Order Traversal | ✓ | ✓ | ✓ | Medium | | 102 | Binary Tree Level Order Traversal | ✓ | ✓ | ✓ | Medium | | 101 | Symmetric Tree | ✓ | ✓ | ✓ | Easy | | 100 | Same Tree | ✓ | ✓ | ✓ | Hard | | 99 | Recover Binary Search Tree | ✓ | ✓ | ✓ | Medium | | 98 | Validate Binary Search Tree | ✓ | ✓ | ✓ | Medium | | 97 | Interleaving String | ✓ | ✓ | ✓ | Medium | | 96 | Unique Binary Search Trees | ✓ | ✓ | ✓ | Medium | | 95 | Unique Binary Search Trees II | ✓ | ✓ | ✓ | Medium | | 94 | Binary Tree Inorder Traversal | ✓ | ✓ | ✓ | Medium | | 93 | Restore IP Addresses | ✓ | ✓ | ✓ | Medium | | 92 | Reverse Linked List II | ✓ | ✓ | ✓ | Medium | | 91 | Decode Ways | ✓ | ✓ | ✓ | Medium | | 90 | Subsets II | ✓ | ✓ | ✓ | Medium | | 89 | Gray Code | ✓ | ✓ | ✓ | Medium | | 88 | Merge Sorted Array | ✓ | ✓ | ✓ | Easy | | 87 | Scramble String | ✓ | ✓ | ✓ | Hard | | 86 | Partition List | ✓ | ✓ | ✓ | Medium | | 85 | Maximal Rectangle | ✓ | ✓ | ✓ | Hard | | 84 | Largest Rectangle in Histogram | ✓ | ✓ | ✓ | Hard | | 83 | Remove Duplicates from Sorted List | ✓ | ✓ | ✓ | Easy | | 82 | Remove Duplicates from Sorted List II | ✓ | ✓ | ✓ | Medium | | 81 | Search in Rotated Sorted Array II | ✓ | ✓ | ✓ | Medium | | 80 | Remove Duplicates from Sorted Array II | ✓ | ✓ | ✓ | Medium | | 79 | Word Search | ✓ | ✓ | ✓ | Medium | | 78 | Subsets | ✓ | ✓ | ✓ | Medium | | 77 | Combinations | ✓ | ✓ | ✓ | Medium | | 76 | Minimum Window Substring | ✓ | ✓ | ✓ | Hard | | 75 | Sort Colors | ✓ | ✓ | ✓ | Medium | | 74 | Search a 2D Matrix | ✓ | ✓ | ✓ | Medium | | 73 | Set Matrix Zeroes | ✓ | ✓ | ✓ | Medium | | 72 | Edit Distance | ✓ | ✓ | ✓ | Hard | | 71 | Simplify Path | ✓ | ✓ | ✓ | Medium | | 70 | Climbing Stairs | ✓ | ✓ | ✓ | Easy | | 69 | Sqrt(x) | ✓ | ✓ | ✓ | Easy | | 68 | Text Justification | ✓ | ✓ | ✓ | Hard | | 67 | Add Binary | ✓ | ✓ | ✓ | Easy | | 66 | Plus One | ✓ | ✓ | ✓ | Easy | | 65 | Valid Number | ✓ | ✓ | ✓ | Hard | | 64 | Minimum Path Sum | ✓ | ✓ | ✓ | Medium | | 63 | Unique Paths II | ✓ | ✓ | ✓ | Medium | | 62 | Unique Paths | ✓ | ✓ | ✓ | Medium | | 61 | Rotate List | ✓ | ✓ | ✓ | Medium | | 60 | Permutation Sequence | ✓ | ✓ | ✓ | Medium | | 59 | Spiral Matrix II | ✓ | ✓ | ✓ | Medium | | 58 | Length of Last Word | ✓ | ✓ | ✓ | Easy | | 57 | Insert Interval | ✓ | ✓ | ✓ | Hard | | 56 | Merge Intervals | ✓ | ✓ | ✓ | Medium | | 55 | Jump Game | ✓ | ✓ | ✓ | Medium | | 54 | Spiral Matrix | ✓ | ✓ | ✓ | Medium | | 53 | Maximum Subarray | ✓ | ✓ | ✓ | Easy | | 52 | N-Queens II | ✓ | ✓ | ✓ | Hard | | 51 | N-Queens | ✓ | ✓ | ✓ | Hard | | 50 | Pow(x, n) | ✓ | ✓ | ✓ | Medium | | 49 | Group Anagrams | ✓ | ✓ | ✓ | Medium | | 48 | Rotate Image | ✓ | ✓ | ✓ | Medium | | 47 | Permutations II | ✓ | ✓ | ✓ | Medium | | 46 | Permutations | ✓ | ✓ | ✓ | Medium | | 45 | Jump Game II | ✓ | ✓ | ✓ | Hard | | 44 | Wildcard Matching | ✓ | ✓ | ✓ | Hard | | 43 | Multiply Strings | ✓ | ✓ | ✓ | Medium | | 42 | Trapping Rain Water | ✓ | ✓ | ✓ | Hard | | 41 | First Missing Positive | ✓ | ✓ | ✓ | Hard | | 40 | Combination Sum II | ✓ | ✓ | ✓ | Medium | | 39 | Combination Sum | ✓ | ✓ | ✓ | Medium | | 38 | Count and Say | ✓ | ✓ | ✓ | Easy | | 37 | Sudoku Solver | ✓ | ✓ | ✓ | Hard | | 36 | Valid Sudoku | ✓ | ✓ | ✓ | Medium | | 35 | Search Insert Position | ✓ | ✓ | ✓ | Easy | | 34 | Find First and Last Position of Element in Sorted Array | ✓ | ✓ | ✓ | Medium | | 33 | Search in Rotated Sorted Array | ✓ | ✓ | ✓ | Medium | | 32 | Longest Valid Parentheses | ✓ | ✓ | ✓ | Hard | | 31 | Next Permutation | ✓ | ✓ | ✓ | Medium | | 30 | Substring with Concatenation of All Words | ✓ | ✓ | ✓ | Hard | | 29 | Divide Two Integers | ✓ | ✓ | ✓ | Medium | | 28 | Implement strStr() | ✓ | ✓ | ✓ | Easy | | 27 | Remove Element | ✓ | ✓ | ✓ | Easy | | 26 | Remove Duplicates from Sorted Array | ✓ | ✓ | ✓ | Easy | | 25 | Reverse Nodes in k-Group | ✓ | ✓ | ✓ | Hard | | 24 | Swap Nodes in Pairs | ✓ | ✓ | ✓ | Medium | | 23 | Merge k Sorted Lists | ✓ | ✓ | ✓ | Hard | | 22 | Generate Parentheses | ✓ | ✓ | ✓ | Medium | | 21 | Merge Two Sorted Lists | ✓ | ✓ | ✓ | Easy | | 20 | Valid Parentheses | ✓ | ✓ | ✓ | Easy | | 19 | Remove Nth Node From End of List | ✓ | ✓ | ✓ | Medium | | 18 | 4Sum | ✓ | ✓ | ✓ | Medium | | 17 | Letter Combinations of a Phone Number | ✓ | ✓ | ✓ | Medium | | 16 | 3Sum Closest | ✓ | ✓ | ✓ | Medium | | 15 | 3Sum | ✓ | ✓ | ✓ | Medium | | 14 | Longest Common Prefix | ✓ | ✓ | ✓ | Easy | | 13 | Roman to Integer | ✓ | ✓ | ✓ | Easy | | 12 | Integer to Roman | ✓ | ✓ | ✓ | Medium | | 11 | Container With Most Water | ✓ | ✓ | ✓ | Medium | | 10 | Regular Expression Matching | ✓ | ✓ | ✓ | Hard | | 9 | Palindrome Number | ✓ | ✓ | ✓ | Easy | | 8 | String to Integer (atoi) | ✓ | ✓ | ✓ | Medium | | 7 | Reverse Integer | ✓ | ✓ | ✓ | Easy | | 6 | ZigZag Conversion | ✓ | ✓ | ✓ | Medium | | 5 | Longest Palindromic Substring | ✓ | ✓ | ✓ | Medium | | 4 | Median of Two Sorted Arrays | ✓ | ✓ | ✓ | Hard | | 3 | Longest Substring Without Repeating Characters | ✓ | ✓ | ✓ | Medium | | 2 | Add Two Numbers | ✓ | ✓ | ✓ | Medium | | 1 | Two Sum | ✓ | ✓ | ✓ | Easy |

This is under an MIT license. See the LICENSE for more information.

Get A Weekly Email With Trending Projects For These Topics

No Spam. Unsubscribe easily at any time.

Javascript (1,532,221)

Python (1,140,932)

Java (696,382)

Php (394,797)

C Plus Plus (369,147)

Ruby (305,165)

C Sharp (276,290)

Go (197,785)

Swift (94,690)

Rust (66,494)

Kotlin (61,607)

Scala (38,858)

Python3 (33,280)

Bash (7,129)

Leetcode (2,582)

Alogrithms (82)

Related Projects