README
¶
LeetCode 的 Go 解答
进度
统计规则：1.免费题，2.算法题，3.能提交 Go 解答
| Easy | Medium | Hard | Total | |
|---|---|---|---|---|
| Accepted | 2 | 0 | 0 | 2 |
| Total | 322 | 599 | 260 | 1181 |
题解
| 题号 | 题目 | 通过率 | 难度 | 收藏 |
|---|---|---|---|---|
| 1563 | * Stone Game V | 42% | Hard | |
| 1562 | * Find Latest Group of Size M | 37% | Medium | |
| 1561 | * Maximum Number of Coins You Can Get | 82% | Medium | |
| 1560 | * Most Visited Sector in a Circular Track | 56% | Easy | |
| 1559 | * Detect Cycles in 2D Grid | 44% | Hard | |
| 1558 | * Minimum Numbers of Function Calls to Make Target Array | 61% | Medium | |
| 1557 | * Minimum Number of Vertices to Reach All Nodes | 70% | Medium | |
| 1556 | * Thousand Separator | 61% | Easy | |
| 1553 | * Minimum Number of Days to Eat N Oranges | 27% | Hard | |
| 1552 | * Magnetic Force Between Two Balls | 46% | Medium | |
| 1551 | * Minimum Operations to Make Array Equal | 77% | Medium | |
| 1550 | * Three Consecutive Odds | 67% | Easy | |
| 1547 | * Minimum Cost to Cut a Stick | 49% | Hard | |
| 1546 | * Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | 42% | Medium | |
| 1545 | * Find Kth Bit in Nth Binary String | 56% | Medium | |
| 1544 | * Make The String Great | 54% | Easy | |
| 1542 | * Find Longest Awesome Substring | 35% | Hard | |
| 1541 | * Minimum Insertions to Balance a Parentheses String | 40% | Medium | |
| 1540 | * Can Convert String in K Moves | 28% | Medium | |
| 1539 | * Kth Missing Positive Number | 53% | Easy | |
| 1537 | * Get the Maximum Score | 35% | Hard | |
| 1536 | * Minimum Swaps to Arrange a Binary Grid | 42% | Medium | |
| 1535 | * Find the Winner of an Array Game | 46% | Medium | |
| 1534 | * Count Good Triplets | 80% | Easy | |
| 1531 | * String Compression II | 29% | Hard | |
| 1530 | * Number of Good Leaf Nodes Pairs | 54% | Medium | |
| 1529 | * Bulb Switcher IV | 70% | Medium | |
| 1528 | * Shuffle String | 85% | Easy | |
| 1526 | * Minimum Number of Increments on Subarrays to Form a Target Array | 58% | Hard | |
| 1525 | * Number of Good Ways to Split a String | 68% | Medium | |
| 1524 | * Number of Sub-arrays With Odd Sum | 37% | Medium | |
| 1523 | * Count Odd Numbers in an Interval Range | 55% | Easy | |
| 1521 | * Find a Value of a Mysterious Function Closest to Target | 43% | Hard | |
| 1520 | * Maximum Number of Non-Overlapping Substrings | 33% | Hard | |
| 1519 | * Number of Nodes in the Sub-Tree With the Same Label | 35% | Medium | |
| 1518 | * Water Bottles | 62% | Easy | |
| 1515 | * Best Position for a Service Centre | 36% | Hard | |
| 1514 | * Path with Maximum Probability | 36% | Medium | |
| 1513 | * Number of Substrings With Only 1s | 40% | Medium | |
| 1512 | * Number of Good Pairs | 88% | Easy | |
| 1510 | * Stone Game IV | 51% | Hard | |
| 1509 | * Minimum Difference Between Largest and Smallest Value in Three Moves | 51% | Medium | |
| 1508 | * Range Sum of Sorted Subarray Sums | 66% | Medium | |
| 1507 | * Reformat Date | 60% | Easy | |
| 1505 | * Minimum Possible Integer After at Most K Adjacent Swaps On Digits | 36% | Hard | |
| 1504 | * Count Submatrices With All Ones | 61% | Medium | |
| 1503 | * Last Moment Before All Ants Fall Out of a Plank | 51% | Medium | |
| 1502 | * Can Make Arithmetic Progression From Sequence | 72% | Easy | |
| 1499 | * Max Value of Equation | 44% | Hard | |
| 1498 | * Number of Subsequences That Satisfy the Given Sum Condition | 36% | Medium | |
| 1497 | * Check If Array Pairs Are Divisible by k | 40% | Medium | |
| 1496 | * Path Crossing | 55% | Easy | |
| 1494 | * Parallel Courses II | 31% | Hard | |
| 1493 | * Longest Subarray of 1's After Deleting One Element | 59% | Medium | |
| 1492 | * The kth Factor of n | 67% | Medium | |
| 1491 | * Average Salary Excluding the Minimum and Maximum Salary | 69% | Easy | |
| 1489 | * Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | 51% | Hard | |
| 1488 | * Avoid Flood in The City | 25% | Medium | |
| 1487 | * Making File Names Unique | 29% | Medium | |
| 1486 | * XOR Operation in an Array | 84% | Easy | |
| 1483 | * Kth Ancestor of a Tree Node | 27% | Hard | |
| 1482 | * Minimum Number of Days to Make m Bouquets | 47% | Medium | |
| 1481 | * Least Number of Unique Integers after K Removals | 53% | Medium | |
| 1480 | * Running Sum of 1d Array | 90% | Easy | |
| 1478 | * Allocate Mailboxes | 55% | Hard | |
| 1477 | * Find Two Non-overlapping Sub-arrays Each With Target Sum | 30% | Medium | |
| 1476 | * Subrectangle Queries | 89% | Medium | |
| 1475 | * Final Prices With a Special Discount in a Shop | 75% | Easy | |
| 1473 | * Paint House III | 48% | Hard | |
| 1472 | * Design Browser History | 65% | Medium | |
| 1471 | * The k Strongest Values in an Array | 57% | Medium | |
| 1470 | * Shuffle the Array | 88% | Easy | |
| 1467 | * Probability of a Two Boxes Having The Same Number of Distinct Balls | 61% | Hard | |
| 1466 | * Reorder Routes to Make All Paths Lead to the City Zero | 63% | Medium | |
| 1465 | * Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 30% | Medium | |
| 1464 | * Maximum Product of Two Elements in an Array | 77% | Easy | |
| 1463 | * Cherry Pickup II | 65% | Hard | |
| 1462 | * Course Schedule IV | 42% | Medium | |
| 1461 | * Check If a String Contains All Binary Codes of Size K | 45% | Medium | |
| 1460 | * Make Two Arrays Equal by Reversing Sub-arrays | 73% | Easy | |
| 1458 | * Max Dot Product of Two Subsequences | 41% | Hard | |
| 1457 | * Pseudo-Palindromic Paths in a Binary Tree | 67% | Medium | |
| 1456 | * Maximum Number of Vowels in a Substring of Given Length | 52% | Medium | |
| 1455 | * Check If a Word Occurs As a Prefix of Any Word in a Sentence | 64% | Easy | |
| 1453 | * Maximum Number of Darts Inside of a Circular Dartboard | 33% | Hard | |
| 1452 | * People Whose List of Favorite Companies Is Not a Subset of Another List | 53% | Medium | |
| 1451 | * Rearrange Words in a Sentence | 55% | Medium | |
| 1450 | * Number of Students Doing Homework at a Given Time | 77% | Easy | |
| 1449 | * Form Largest Integer With Digits That Add up to Target | 42% | Hard | |
| 1448 | * Count Good Nodes in Binary Tree | 70% | Medium | |
| 1447 | * Simplified Fractions | 61% | Medium | |
| 1446 | * Consecutive Characters | 59% | Easy | |
| 1444 | * Number of Ways of Cutting a Pizza | 52% | Hard | |
| 1443 | * Minimum Time to Collect All Apples in a Tree | 55% | Medium | |
| 1442 | * Count Triplets That Can Form Two Arrays of Equal XOR | 69% | Medium | |
| 1441 | * Build an Array With Stack Operations | 69% | Easy | |
| 1439 | * Find the Kth Smallest Sum of a Matrix With Sorted Rows | 59% | Hard | |
| 1438 | * Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | 42% | Medium | |
| 1437 | * Check If All 1's Are at Least Length K Places Away | 63% | Medium | |
| 1436 | * Destination City | 76% | Easy | |
| 1434 | * Number of Ways to Wear Different Hats to Each Other | 37% | Hard | |
| 1433 | * Check If a String Can Break Another String | 65% | Medium | |
| 1432 | * Max Difference You Can Get From Changing an Integer | 42% | Medium | |
| 1431 | * Kids With the Greatest Number of Candies | 88% | Easy | |
| 1425 | * Constrained Subsequence Sum | 44% | Hard | |
| 1424 | * Diagonal Traverse II | 42% | Medium | |
| 1423 | * Maximum Points You Can Obtain from Cards | 43% | Medium | |
| 1422 | * Maximum Score After Splitting a String | 54% | Easy | |
| 1420 | * Build Array Where You Can Find The Maximum Exactly K Comparisons | 64% | Hard | |
| 1419 | * Minimum Number of Frogs Croaking | 46% | Medium | |
| 1418 | * Display Table of Food Orders in a Restaurant | 66% | Medium | |
| 1417 | * Reformat The String | 54% | Easy | |
| 1416 | * Restore The Array | 36% | Hard | |
| 1415 | * The k-th Lexicographical String of All Happy Strings of Length n | 70% | Medium | |
| 1414 | * Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | 63% | Medium | |
| 1413 | * Minimum Value to Get Positive Step by Step Sum | 65% | Easy | |
| 1411 | * Number of Ways to Paint N × 3 Grid | 61% | Hard | |
| 1410 | * HTML Entity Parser | 54% | Medium | |
| 1409 | * Queries on a Permutation With Key | 81% | Medium | |
| 1408 | * String Matching in an Array | 61% | Easy | |
| 1406 | * Stone Game III | 56% | Hard | |
| 1405 | * Longest Happy String | 49% | Medium | |
| 1404 | * Number of Steps to Reduce a Number in Binary Representation to One | 50% | Medium | |
| 1403 | * Minimum Subsequence in Non-Increasing Order | 70% | Easy | |
| 1402 | * Reducing Dishes | 72% | Hard | |
| 1401 | * Circle and Rectangle Overlapping | 42% | Medium | |
| 1400 | * Construct K Palindrome Strings | 60% | Medium | |
| 1399 | * Count Largest Group | 64% | Easy | |
| 1397 | * Find All Good Strings | 37% | Hard | |
| 1396 | * Design Underground System | 65% | Medium | |
| 1395 | * Count Number of Teams | 82% | Medium | |
| 1394 | * Find Lucky Integer in an Array | 64% | Easy | |
| 1392 | * Longest Happy Prefix | 40% | Hard | |
| 1391 | * Check if There is a Valid Path in a Grid | 44% | Medium | |
| 1390 | * Four Divisors | 38% | Medium | |
| 1389 | * Create Target Array in the Given Order | 84% | Easy | |
| 1388 | * Pizza With 3n Slices | 44% | Hard | |
| 1387 | * Sort Integers by The Power Value | 70% | Medium | |
| 1386 | * Cinema Seat Allocation | 34% | Medium | |
| 1385 | * Find the Distance Value Between Two Arrays | 66% | Easy | |
| 1383 | * Maximum Performance of a Team | 31% | Hard | |
| 1382 | * Balance a Binary Search Tree | 74% | Medium | |
| 1381 | * Design a Stack With Increment Operation | 75% | Medium | |
| 1380 | * Lucky Numbers in a Matrix | 71% | Easy | |
| 1379 | * Find a Corresponding Node of a Binary Tree in a Clone of That Tree | 83% | Medium | |
| 1377 | * Frog Position After T Seconds | 33% | Hard | |
| 1376 | * Time Needed to Inform All Employees | 55% | Medium | |
| 1375 | * Bulb Switcher III | 62% | Medium | |
| 1374 | * Generate a String With Characters That Have Odd Counts | 75% | Easy | |
| 1373 | * Maximum Sum BST in Binary Tree | 39% | Hard | |
| 1372 | * Longest ZigZag Path in a Binary Tree | 54% | Medium | |
| 1371 | * Find the Longest Substring Containing Vowels in Even Counts | 58% | Medium | |
| 1370 | * Increasing Decreasing String | 75% | Easy | |
| 1368 | * Minimum Cost to Make at Least One Valid Path in a Grid | 54% | Hard | |
| 1367 | * Linked List in Binary Tree | 41% | Medium | |
| 1366 | * Rank Teams by Votes | 53% | Medium | |
| 1365 | * How Many Numbers Are Smaller Than the Current Number | 85% | Easy | |
| 1363 | * Largest Multiple of Three | 33% | Hard | |
| 1362 | * Closest Divisors | 56% | Medium | |
| 1361 | * Validate Binary Tree Nodes | 47% | Medium | |
| 1360 | * Number of Days Between Two Dates | 48% | Easy | |
| 1359 | * Count All Valid Pickup and Delivery Options | 57% | Hard | |
| 1358 | * Number of Substrings Containing All Three Characters | 58% | Medium | |
| 1357 | * Apply Discount Every n Orders | 66% | Medium | |
| 1356 | * Sort Integers by The Number of 1 Bits | 68% | Easy | |
| 1354 | * Construct Target Array With Multiple Sums | 31% | Hard | |
| 1353 | * Maximum Number of Events That Can Be Attended | 30% | Medium | |
| 1352 | * Product of the Last K Numbers | 43% | Medium | |
| 1351 | * Count Negative Numbers in a Sorted Matrix | 76% | Easy | |
| 1349 | * Maximum Students Taking Exam | 42% | Hard | |
| 1348 | * Tweet Counts Per Frequency | 29% | Medium | |
| 1347 | * Minimum Number of Steps to Make Two Strings Anagram | 74% | Medium | |
| 1346 | * Check If N and Its Double Exist | 37% | Easy | |
| 1345 | * Jump Game IV | 38% | Hard | |
| 1344 | * Angle Between Hands of a Clock | 61% | Medium | |
| 1343 | * Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | 64% | Medium | |
| 1342 | * Number of Steps to Reduce a Number to Zero | 86% | Easy | |
| 1340 | * Jump Game V | 57% | Hard | |
| 1339 | * Maximum Product of Splitted Binary Tree | 37% | Medium | |
| 1338 | * Reduce Array Size to The Half | 66% | Medium | |
| 1337 | * The K Weakest Rows in a Matrix | 68% | Easy | |
| 1335 | * Minimum Difficulty of a Job Schedule | 57% | Hard | |
| 1334 | * Find the City With the Smallest Number of Neighbors at a Threshold Distance | 44% | Medium | |
| 1333 | * Filter Restaurants by Vegan-Friendly, Price and Distance | 54% | Medium | |
| 1332 | * Remove Palindromic Subsequences | 60% | Easy | |
| 1331 | * Rank Transform of an Array | 57% | Easy | |
| 1330 | * Reverse Subarray To Maximize Array Value | 35% | Hard | |
| 1329 | * Sort the Matrix Diagonally | 78% | Medium | |
| 1328 | * Break a Palindrome | 43% | Medium | |
| 1326 | * Minimum Number of Taps to Open to Water a Garden | 43% | Hard | |
| 1325 | * Delete Leaves With a Given Value | 73% | Medium | |
| 1324 | * Print Words Vertically | 57% | Medium | |
| 1323 | * Maximum 69 Number | 77% | Easy | |
| 1320 | * Minimum Distance to Type a Word Using Two Fingers | 62% | Hard | |
| 1319 | * Number of Operations to Make Network Connected | 53% | Medium | |
| 1318 | * Minimum Flips to Make a OR b Equal to c | 62% | Medium | |
| 1317 | * Convert Integer to the Sum of Two No-Zero Integers | 56% | Easy | |
| 1316 | * Distinct Echo Substrings | 46% | Hard | |
| 1315 | * Sum of Nodes with Even-Valued Grandparent | 83% | Medium | |
| 1314 | * Matrix Block Sum | 73% | Medium | |
| 1313 | * Decompress Run-Length Encoded List | 85% | Easy | |
| 1312 | * Minimum Insertion Steps to Make a String Palindrome | 58% | Hard | |
| 1311 | * Get Watched Videos by Your Friends | 43% | Medium | |
| 1310 | * XOR Queries of a Subarray | 68% | Medium | |
| 1309 | * Decrypt String from Alphabet to Integer Mapping | 76% | Easy | |
| 1307 | * Verbal Arithmetic Puzzle | 37% | Hard | |
| 1306 | * Jump Game III | 60% | Medium | |
| 1305 | * All Elements in Two Binary Search Trees | 76% | Medium | |
| 1304 | * Find N Unique Integers Sum up to Zero | 76% | Easy | |
| 1302 | * Deepest Leaves Sum | 83% | Medium | |
| 1301 | * Number of Paths with Max Score | 37% | Hard | |
| 1300 | * Sum of Mutated Array Closest to Target | 43% | Medium | |
| 1299 | * Replace Elements with Greatest Element on Right Side | 75% | Easy | |
| 1298 | * Maximum Candies You Can Get from Boxes | 58% | Hard | |
| 1297 | * Maximum Number of Occurrences of a Substring | 47% | Medium | |
| 1296 | * Divide Array in Sets of K Consecutive Numbers | 54% | Medium | |
| 1295 | * Find Numbers with Even Number of Digits | 81% | Easy | |
| 1293 | * Shortest Path in a Grid with Obstacles Elimination | 42% | Hard | |
| 1292 | * Maximum Side Length of a Square with Sum Less than or Equal to Threshold | 48% | Medium | |
| 1291 | * Sequential Digits | 53% | Medium | |
| 1290 | * Convert Binary Number in a Linked List to Integer | 80% | Easy | |
| 1289 | * Minimum Falling Path Sum II | 61% | Hard | |
| 1288 | * Remove Covered Intervals | 57% | Medium | |
| 1287 | * Element Appearing More Than 25% In Sorted Array | 60% | Easy | |
| 1286 | * Iterator for Combination | 70% | Medium | |
| 1284 | * Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | 69% | Hard | |
| 1283 | * Find the Smallest Divisor Given a Threshold | 48% | Medium | |
| 1282 | * Group the People Given the Group Size They Belong To | 84% | Medium | |
| 1281 | * Subtract the Product and Sum of Digits of an Integer | 85% | Easy | |
| 1278 | * Palindrome Partitioning III | 59% | Hard | |
| 1277 | * Count Square Submatrices with All Ones | 73% | Medium | |
| 1276 | * Number of Burgers with No Waste of Ingredients | 49% | Medium | |
| 1275 | * Find Winner on a Tic Tac Toe Game | 52% | Easy | |
| 1269 | * Number of Ways to Stay in the Same Place After Some Steps | 43% | Hard | |
| 1268 | * Search Suggestions System | 63% | Medium | |
| 1267 | * Count Servers that Communicate | 57% | Medium | |
| 1266 | * Minimum Time Visiting All Points | 79% | Easy | |
| 1263 | * Minimum Moves to Move a Box to Their Target Location | 41% | Hard | |
| 1262 | * Greatest Sum Divisible by Three | 47% | Medium | |
| 1261 | * Find Elements in a Contaminated Binary Tree | 74% | Medium | |
| 1260 | * Shift 2D Grid | 61% | Easy | |
| 1255 | * Maximum Score Words Formed by Letters | 69% | Hard | |
| 1254 | * Number of Closed Islands | 60% | Medium | |
| 1253 | * Reconstruct a 2-Row Binary Matrix | 40% | Medium | |
| 1252 | * Cells with Odd Values in a Matrix | 78% | Easy | |
| 1250 | * Check If It Is a Good Array | 55% | Hard | |
| 1249 | * Minimum Remove to Make Valid Parentheses | 62% | Medium | |
| 1248 | * Count Number of Nice Subarrays | 56% | Medium | |
| 1247 | * Minimum Swaps to Make Strings Equal | 60% | Medium | |
| 1240 | * Tiling a Rectangle with the Fewest Squares | 50% | Hard | |
| 1239 | * Maximum Length of a Concatenated String with Unique Characters | 47% | Medium | |
| 1238 | * Circular Permutation in Binary Representation | 65% | Medium | |
| 1237 | * Find Positive Integer Solution for a Given Equation | 69% | Easy | |
| 1235 | * Maximum Profit in Job Scheduling | 44% | Hard | |
| 1234 | * Replace the Substring for Balanced String | 33% | Medium | |
| 1233 | * Remove Sub-Folders from the Filesystem | 59% | Medium | |
| 1232 | * Check If It Is a Straight Line | 45% | Easy | |
| 1227 | * Airplane Seat Assignment Probability | 61% | Medium | |
| 1224 | * Maximum Equal Frequency | 33% | Hard | |
| 1223 | * Dice Roll Simulation | 45% | Medium | |
| 1222 | * Queens That Can Attack the King | 68% | Medium | |
| 1221 | * Split a String in Balanced Strings | 83% | Easy | |
| 1220 | * Count Vowels Permutation | 54% | Hard | |
| 1219 | * Path with Maximum Gold | 65% | Medium | |
| 1218 | * Longest Arithmetic Subsequence of Given Difference | 44% | Medium | |
| 1217 | * Minimum Cost to Move Chips to The Same Position | 64% | Easy | |
| 1210 | * Minimum Moves to Reach Target with Rotations | 45% | Hard | |
| 1209 | * Remove All Adjacent Duplicates in String II | 56% | Medium | |
| 1208 | * Get Equal Substrings Within Budget | 42% | Medium | |
| 1207 | * Unique Number of Occurrences | 71% | Easy | |
| 1206 | * Design Skiplist | 57% | Hard | |
| 1203 | * Sort Items by Groups Respecting Dependencies | 47% | Hard | |
| 1202 | * Smallest String With Swaps | 46% | Medium | |
| 1201 | * Ugly Number III | 26% | Medium | |
| 1200 | * Minimum Absolute Difference | 66% | Easy | |
| 1192 | * Critical Connections in a Network | 48% | Hard | |
| 1191 | * K-Concatenation Maximum Sum | 25% | Medium | |
| 1190 | * Reverse Substrings Between Each Pair of Parentheses | 61% | Medium | |
| 1189 | * Maximum Number of Balloons | 61% | Easy | |
| 1187 | * Make Array Strictly Increasing | 41% | Hard | |
| 1186 | * Maximum Subarray Sum with One Deletion | 37% | Medium | |
| 1185 | * Day of the Week | 63% | Easy | |
| 1184 | * Distance Between Bus Stops | 54% | Easy | |
| 1178 | * Number of Valid Words for Each Puzzle | 37% | Hard | |
| 1177 | * Can Make Palindrome from Substring | 34% | Medium | |
| 1175 | * Prime Arrangements | 51% | Easy | |
| 1172 | * Dinner Plate Stacks | 38% | Hard | |
| 1171 | * Remove Zero Sum Consecutive Nodes from Linked List | 41% | Medium | |
| 1170 | * Compare Strings by Frequency of the Smallest Character | 58% | Easy | |
| 1169 | * Invalid Transactions | 31% | Medium | |
| 1163 | * Last Substring in Lexicographical Order | 34% | Hard | |
| 1162 | * As Far from Land as Possible | 43% | Medium | |
| 1161 | * Maximum Level Sum of a Binary Tree | 72% | Medium | |
| 1160 | * Find Words That Can Be Formed by Characters | 67% | Easy | |
| 1157 | * Online Majority Element In Subarray | 39% | Hard | |
| 1156 | * Swap For Longest Repeated Character Substring | 48% | Medium | |
| 1155 | * Number of Dice Rolls With Target Sum | 48% | Medium | |
| 1154 | * Day of the Year | 49% | Easy | |
| 1147 | * Longest Chunked Palindrome Decomposition | 58% | Hard | |
| 1146 | * Snapshot Array | 37% | Medium | |
| 1145 | * Binary Tree Coloring Game | 51% | Medium | |
| 1144 | * Decrease Elements To Make Array Zigzag | 45% | Medium | |
| 1143 | * Longest Common Subsequence | 58% | Medium | |
| 1140 | * Stone Game II | 63% | Medium | |
| 1139 | * Largest 1-Bordered Square | 47% | Medium | |
| 1138 | * Alphabet Board Path | 48% | Medium | |
| 1137 | * N-th Tribonacci Number | 55% | Easy | |
| 1131 | * Maximum of Absolute Value Expression | 52% | Medium | |
| 1130 | * Minimum Cost Tree From Leaf Values | 66% | Medium | |
| 1129 | * Shortest Path with Alternating Colors | 39% | Medium | |
| 1128 | * Number of Equivalent Domino Pairs | 47% | Easy | |
| 1125 | * Smallest Sufficient Team | 46% | Hard | |
| 1124 | * Longest Well-Performing Interval | 32% | Medium | |
| 1123 | * Lowest Common Ancestor of Deepest Leaves | 66% | Medium | |
| 1122 | * Relative Sort Array | 67% | Easy | |
| 1111 | * Maximum Nesting Depth of Two Valid Parentheses Strings | 70% | Medium | |
| 1110 | * Delete Nodes And Return Forest | 67% | Medium | |
| 1109 | * Corporate Flight Bookings | 52% | Medium | |
| 1108 | * Defanging an IP Address | 87% | Easy | |
| 1106 | * Parsing A Boolean Expression | 58% | Hard | |
| 1105 | * Filling Bookcase Shelves | 57% | Medium | |
| 1104 | * Path In Zigzag Labelled Binary Tree | 72% | Medium | |
| 1103 | * Distribute Candies to People | 63% | Easy | |
| 1096 | * Brace Expansion II | 62% | Hard | |
| 1095 | * Find in Mountain Array | 35% | Hard | |
| 1094 | * Car Pooling | 56% | Medium | |
| 1093 | * Statistics from a Large Sample | 48% | Medium | |
| 1092 | * Shortest Common Supersequence | 51% | Hard | |
| 1091 | * Shortest Path in Binary Matrix | 38% | Medium | |
| 1090 | * Largest Values From Labels | 58% | Medium | |
| 1089 | * Duplicate Zeros | 52% | Easy | |
| 1081 | * Smallest Subsequence of Distinct Characters | 50% | Medium | |
| 1080 | * Insufficient Nodes in Root to Leaf Paths | 49% | Medium | |
| 1079 | * Letter Tile Possibilities | 75% | Medium | |
| 1078 | * Occurrences After Bigram | 64% | Easy | |
| 1074 | * Number of Submatrices That Sum to Target | 60% | Hard | |
| 1073 | * Adding Two Negabinary Numbers | 34% | Medium | |
| 1072 | * Flip Columns For Maximum Number of Equal Rows | 61% | Medium | |
| 1071 | * Greatest Common Divisor of Strings | 52% | Easy | |
| 1054 | * Distant Barcodes | 43% | Medium | |
| 1053 | * Previous Permutation With One Swap | 48% | Medium | |
| 1052 | * Grumpy Bookstore Owner | 55% | Medium | |
| 1051 | * Height Checker | 71% | Easy | |
| 1049 | * Last Stone Weight II | 44% | Medium | |
| 1048 | * Longest String Chain | 54% | Medium | |
| 1047 | * Remove All Adjacent Duplicates In String | 68% | Easy | |
| 1046 | * Last Stone Weight | 62% | Easy | |
| 1044 | * Longest Duplicate Substring | 31% | Hard | |
| 1043 | * Partition Array for Maximum Sum | 65% | Medium | |
| 1042 | * Flower Planting With No Adjacent | 48% | Easy | |
| 1041 | * Robot Bounded In Circle | 50% | Medium | |
| 1040 | * Moving Stones Until Consecutive II | 52% | Medium | |
| 1039 | * Minimum Score Triangulation of Polygon | 49% | Medium | |
| 1038 | * Binary Search Tree to Greater Sum Tree | 80% | Medium | |
| 1037 | * Valid Boomerang | 37% | Easy | |
| 1036 | * Escape a Large Maze | 35% | Hard | |
| 1035 | * Uncrossed Lines | 56% | Medium | |
| 1034 | * Coloring A Border | 44% | Medium | |
| 1033 | * Moving Stones Until Consecutive | 41% | Easy | |
| 1032 | * Stream of Characters | 48% | Hard | |
| 1031 | * Maximum Sum of Two Non-Overlapping Subarrays | 58% | Medium | |
| 1030 | * Matrix Cells in Distance Order | 65% | Easy | |
| 1029 | * Two City Scheduling | 56% | Medium | |
| 1028 | * Recover a Tree From Preorder Traversal | 70% | Hard | |
| 1027 | * Longest Arithmetic Subsequence | 52% | Medium | |
| 1026 | * Maximum Difference Between Node and Ancestor | 66% | Medium | |
| 1025 | * Divisor Game | 66% | Easy | |
| 1024 | * Video Stitching | 49% | Medium | |
| 1023 | * Camelcase Matching | 56% | Medium | |
| 1022 | * Sum of Root To Leaf Binary Numbers | 67% | Easy | |
| 1021 | * Remove Outermost Parentheses | 78% | Easy | |
| 1020 | * Number of Enclaves | 57% | Medium | |
| 1019 | * Next Greater Node In Linked List | 58% | Medium | |
| 1018 | * Binary Prefix Divisible By 5 | 47% | Easy | |
| 1017 | * Convert to Base -2 | 59% | Medium | |
| 1016 | * Binary String With Substrings Representing 1 To N | 58% | Medium | |
| 1015 | * Smallest Integer Divisible by K | 32% | Medium | |
| 1014 | * Best Sightseeing Pair | 52% | Medium | |
| 1013 | * Partition Array Into Three Parts With Equal Sum | 51% | Easy | |
| 1012 | * Numbers With Repeated Digits | 37% | Hard | |
| 1011 | * Capacity To Ship Packages Within D Days | 58% | Medium | |
| 1010 | * Pairs of Songs With Total Durations Divisible by 60 | 47% | Easy | |
| 1009 | * Complement of Base 10 Integer | 59% | Easy | |
| 1008 | * Construct Binary Search Tree from Preorder Traversal | 78% | Medium | |
| 1007 | * Minimum Domino Rotations For Equal Row | 50% | Medium | |
| 1006 | * Clumsy Factorial | 53% | Medium | |
| 1005 | * Maximize Sum Of Array After K Negations | 51% | Easy | |
| 1004 | * Max Consecutive Ones III | 59% | Medium | |
| 1003 | * Check If Word Is Valid After Substitutions | 55% | Medium | |
| 1002 | * Find Common Characters | 67% | Easy | |
| 1001 | * Grid Illumination | 35% | Hard | |
| 1000 | * Minimum Cost to Merge Stones | 40% | Hard | |
| 0999 | * Available Captures for Rook | 66% | Easy | |
| 0998 | * Maximum Binary Tree II | 63% | Medium | |
| 0997 | * Find the Town Judge | 50% | Easy | |
| 0996 | * Number of Squareful Arrays | 47% | Hard | |
| 0995 | * Minimum Number of K Consecutive Bit Flips | 46% | Hard | |
| 0994 | * Rotting Oranges | 49% | Medium | |
| 0993 | * Cousins in Binary Tree | 52% | Easy | |
| 0992 | * Subarrays with K Different Integers | 48% | Hard | |
| 0991 | * Broken Calculator | 45% | Medium | |
| 0990 | * Satisfiability of Equality Equations | 45% | Medium | |
| 0989 | * Add to Array-Form of Integer | 44% | Easy | |
| 0988 | * Smallest String Starting From Leaf | 46% | Medium | |
| 0987 | * Vertical Order Traversal of a Binary Tree | 36% | Medium | |
| 0986 | * Interval List Intersections | 67% | Medium | |
| 0985 | * Sum of Even Numbers After Queries | 61% | Easy | |
| 0984 | * String Without AAA or BBB | 37% | Medium | |
| 0983 | * Minimum Cost For Tickets | 62% | Medium | |
| 0982 | * Triples with Bitwise AND Equal To Zero | 55% | Hard | |
| 0981 | * Time Based Key-Value Store | 53% | Medium | |
| 0980 | * Unique Paths III | 73% | Hard | |
| 0979 | * Distribute Coins in Binary Tree | 69% | Medium | |
| 0978 | * Longest Turbulent Subarray | 46% | Medium | |
| 0977 | * Squares of a Sorted Array | 72% | Easy | |
| 0976 | * Largest Perimeter Triangle | 57% | Easy | |
| 0975 | * Odd Even Jump | 42% | Hard | |
| 0974 | * Subarray Sums Divisible by K | 49% | Medium | |
| 0973 | * K Closest Points to Origin | 63% | Medium | |
| 0972 | * Equal Rational Numbers | 41% | Hard | |
| 0971 | * Flip Binary Tree To Match Preorder Traversal | 45% | Medium | |
| 0970 | * Powerful Integers | 39% | Easy | |
| 0969 | * Pancake Sorting | 67% | Medium | |
| 0968 | * Binary Tree Cameras | 37% | Hard | |
| 0967 | * Numbers With Same Consecutive Differences | 43% | Medium | |
| 0966 | * Vowel Spellchecker | 47% | Medium | |
| 0965 | * Univalued Binary Tree | 67% | Easy | |
| 0964 | * Least Operators to Express Number | 43% | Hard | |
| 0963 | * Minimum Area Rectangle II | 50% | Medium | |
| 0962 | * Maximum Width Ramp | 45% | Medium | |
| 0961 | * N-Repeated Element in Size 2N Array | 73% | Easy | |
| 0960 | * Delete Columns to Make Sorted III | 53% | Hard | |
| 0959 | * Regions Cut By Slashes | 66% | Medium | |
| 0958 | * Check Completeness of a Binary Tree | 52% | Medium | |
| 0957 | * Prison Cells After N Days | 40% | Medium | |
| 0956 | * Tallest Billboard | 39% | Hard | |
| 0955 | * Delete Columns to Make Sorted II | 33% | Medium | |
| 0954 | * Array of Doubled Pairs | 35% | Medium | |
| 0953 | * Verifying an Alien Dictionary | 53% | Easy | |
| 0952 | * Largest Component Size by Common Factor | 30% | Hard | |
| 0951 | * Flip Equivalent Binary Trees | 65% | Medium | |
| 0950 | * Reveal Cards In Increasing Order | 74% | Medium | |
| 0949 | * Largest Time for Given Digits | 35% | Easy | |
| 0948 | * Bag of Tokens | 40% | Medium | |
| 0947 | * Most Stones Removed with Same Row or Column | 55% | Medium | |
| 0946 | * Validate Stack Sequences | 62% | Medium | |
| 0945 | * Minimum Increment to Make Array Unique | 46% | Medium | |
| 0944 | * Delete Columns to Make Sorted | 70% | Easy | |
| 0943 | * Find the Shortest Superstring | 42% | Hard | |
| 0942 | * DI String Match | 72% | Easy | |
| 0941 | * Valid Mountain Array | 32% | Easy | |
| 0940 | * Distinct Subsequences II | 41% | Hard | |
| 0939 | * Minimum Area Rectangle | 51% | Medium | |
| 0938 | * Range Sum of BST | 81% | Easy | |
| 0937 | * Reorder Data in Log Files | 54% | Easy | |
| 0936 | * Stamping The Sequence | 43% | Hard | |
| 0935 | * Knight Dialer | 45% | Medium | |
| 0934 | * Shortest Bridge | 48% | Medium | |
| 0933 | * Number of Recent Calls | 71% | Easy | |
| 0932 | * Beautiful Array | 58% | Medium | |
| 0931 | * Minimum Falling Path Sum | 62% | Medium | |
| 0930 | * Binary Subarrays With Sum | 43% | Medium | |
| 0929 | * Unique Email Addresses | 67% | Easy | |
| 0928 | * Minimize Malware Spread II | 40% | Hard | |
| 0927 | * Three Equal Parts | 33% | Hard | |
| 0926 | * Flip String to Monotone Increasing | 52% | Medium | |
| 0925 | * Long Pressed Name | 40% | Easy | |
| 0924 | * Minimize Malware Spread | 41% | Hard | |
| 0923 | * 3Sum With Multiplicity | 35% | Medium | |
| 0922 | * Sort Array By Parity II | 69% | Easy | |
| 0921 | * Minimum Add to Make Parentheses Valid | 73% | Medium | |
| 0920 | * Number of Music Playlists | 46% | Hard | |
| 0919 | * Complete Binary Tree Inserter | 57% | Medium | |
| 0918 | * Maximum Sum Circular Subarray | 33% | Medium | |
| 0917 | * Reverse Only Letters | 57% | Easy | |
| 0916 | * Word Subsets | 47% | Medium | |
| 0915 | * Partition Array into Disjoint Intervals | 45% | Medium | |
| 0914 | * X of a Kind in a Deck of Cards | 35% | Easy | |
| 0913 | * Cat and Mouse | 31% | Hard | |
| 0912 | * Sort an Array | 63% | Medium | |
| 0911 | * Online Election | 50% | Medium | |
| 0910 | * Smallest Range II | 26% | Medium | |
| 0909 | * Snakes and Ladders | 38% | Medium | |
| 0908 | * Smallest Range I | 65% | Easy | |
| 0907 | * Sum of Subarray Minimums | 32% | Medium | |
| 0906 | * Super Palindromes | 32% | Hard | |
| 0905 | * Sort Array By Parity | 74% | Easy | |
| 0904 | * Fruit Into Baskets | 42% | Medium | |
| 0903 | * Valid Permutations for DI Sequence | 49% | Hard | |
| 0902 | * Numbers At Most N Given Digit Set | 31% | Hard | |
| 0901 | * Online Stock Span | 60% | Medium | |
| 0900 | * RLE Iterator | 53% | Medium | |
| 0899 | * Orderly Queue | 52% | Hard | |
| 0898 | * Bitwise ORs of Subarrays | 34% | Medium | |
| 0897 | * Increasing Order Search Tree | 71% | Easy | |
| 0896 | * Monotonic Array | 58% | Easy | |
| 0895 | * Maximum Frequency Stack | 60% | Hard | |
| 0894 | * All Possible Full Binary Trees | 75% | Medium | |
| 0893 | * Groups of Special-Equivalent Strings | 66% | Easy | |
| 0892 | * Surface Area of 3D Shapes | 59% | Easy | |
| 0891 | * Sum of Subsequence Widths | 32% | Hard | |
| 0890 | * Find and Replace Pattern | 73% | Medium | |
| 0889 | * Construct Binary Tree from Preorder and Postorder Traversal | 66% | Medium | |
| 0888 | * Fair Candy Swap | 58% | Easy | |
| 0887 | * Super Egg Drop | 27% | Hard | |
| 0886 | * Possible Bipartition | 44% | Medium | |
| 0885 | * Spiral Matrix III | 69% | Medium | |
| 0884 | * Uncommon Words from Two Sentences | 63% | Easy | |
| 0883 | * Projection Area of 3D Shapes | 67% | Easy | |
| 0882 | * Reachable Nodes In Subdivided Graph | 41% | Hard | |
| 0881 | * Boats to Save People | 46% | Medium | |
| 0880 | * Decoded String at Index | 24% | Medium | |
| 0879 | * Profitable Schemes | 39% | Hard | |
| 0878 | * Nth Magical Number | 28% | Hard | |
| 0877 | * Stone Game | 64% | Medium | |
| 0876 | * Middle of the Linked List | 68% | Easy | |
| 0875 | * Koko Eating Bananas | 52% | Medium | |
| 0874 | * Walking Robot Simulation | 35% | Easy | |
| 0873 | * Length of Longest Fibonacci Subsequence | 47% | Medium | |
| 0872 | * Leaf-Similar Trees | 64% | Easy | |
| 0871 | * Minimum Number of Refueling Stops | 31% | Hard | |
| 0870 | * Advantage Shuffle | 45% | Medium | |
| 0869 | * Reordered Power of 2 | 53% | Medium | |
| 0868 | * Binary Gap | 60% | Easy | |
| 0867 | * Transpose Matrix | 62% | Easy | |
| 0866 | * Prime Palindrome | 24% | Medium | |
| 0865 | * Smallest Subtree with all the Deepest Nodes | 60% | Medium | |
| 0864 | * Shortest Path to Get All Keys | 40% | Hard | |
| 0863 | * All Nodes Distance K in Binary Tree | 55% | Medium | |
| 0862 | * Shortest Subarray with Sum at Least K | 24% | Hard | |
| 0861 | * Score After Flipping Matrix | 72% | Medium | |
| 0860 | * Lemonade Change | 51% | Easy | |
| 0859 | * Buddy Strings | 27% | Easy | |
| 0858 | * Mirror Reflection | 53% | Medium | |
| 0857 | * Minimum Cost to Hire K Workers | 49% | Hard | |
| 0856 | * Score of Parentheses | 60% | Medium | |
| 0855 | * Exam Room | 43% | Medium | |
| 0854 | * K-Similar Strings | 38% | Hard | |
| 0853 | * Car Fleet | 42% | Medium | |
| 0852 | * Peak Index in a Mountain Array | 71% | Easy | |
| 0851 | * Loud and Rich | 51% | Medium | |
| 0850 | * Rectangle Area II | 47% | Hard | |
| 0849 | * Maximize Distance to Closest Person | 42% | Easy | |
| 0848 | * Shifting Letters | 44% | Medium | |
| 0847 | * Shortest Path Visiting All Nodes | 52% | Hard | |
| 0846 | * Hand of Straights | 54% | Medium | |
| 0845 | * Longest Mountain in Array | 37% | Medium | |
| 0844 | * Backspace String Compare | 46% | Easy | |
| 0843 | * Guess the Word | 46% | Hard | |
| 0842 | * Split Array into Fibonacci Sequence | 36% | Medium | |
| 0841 | * Keys and Rooms | 64% | Medium | |
| 0840 | * Magic Squares In Grid | 37% | Easy | |
| 0839 | * Similar String Groups | 38% | Hard | |
| 0838 | * Push Dominoes | 48% | Medium | |
| 0837 | * New 21 Game | 34% | Medium | |
| 0836 | * Rectangle Overlap | 48% | Easy | |
| 0835 | * Image Overlap | 58% | Medium | |
| 0834 | * Sum of Distances in Tree | 43% | Hard | |
| 0833 | * Find And Replace in String | 50% | Medium | |
| 0832 | * Flipping an Image | 76% | Easy | |
| 0831 | * Masking Personal Information | 44% | Medium | |
| 0830 | * Positions of Large Groups | 49% | Easy | |
| 0829 | * Consecutive Numbers Sum | 37% | Hard | |
| 0828 | * Count Unique Characters of All Substrings of a Given String | 45% | Hard | |
| 0827 | * Making A Large Island | 45% | Hard | |
| 0826 | * Most Profit Assigning Work | 38% | Medium | |
| 0825 | * Friends Of Appropriate Ages | 42% | Medium | |
| 0824 | * Goat Latin | 65% | Easy | |
| 0823 | * Binary Trees With Factors | 35% | Medium | |
| 0822 | * Card Flipping Game | 43% | Medium | |
| 0821 | * Shortest Distance to a Character | 67% | Easy | |
| 0820 | * Short Encoding of Words | 50% | Medium | |
| 0819 | * Most Common Word | 44% | Easy | |
| 0818 | * Race Car | 39% | Hard | |
| 0817 | * Linked List Components | 57% | Medium | |
| 0816 | * Ambiguous Coordinates | 47% | Medium | |
| 0815 | * Bus Routes | 42% | Hard | |
| 0814 | * Binary Tree Pruning | 74% | Medium | |
| 0813 | * Largest Sum of Averages | 50% | Medium | |
| 0812 | * Largest Triangle Area | 58% | Easy | |
| 0811 | * Subdomain Visit Count | 70% | Easy | |
| 0810 | * Chalkboard XOR Game | 48% | Hard | |
| 0809 | * Expressive Words | 46% | Medium | |
| 0808 | * Soup Servings | 40% | Medium | |
| 0807 | * Max Increase to Keep City Skyline | 83% | Medium | |
| 0806 | * Number of Lines To Write String | 64% | Easy | |
| 0805 | * Split Array With Same Average | 26% | Hard | |
| 0804 | * Unique Morse Code Words | 77% | Easy | |
| 0803 | * Bricks Falling When Hit | 30% | Hard | |
| 0802 | * Find Eventual Safe States | 48% | Medium | |
| 0801 | * Minimum Swaps To Make Sequences Increasing | 38% | Medium | |
| 0799 | * Champagne Tower | 35% | Medium | |
| 0798 | * Smallest Rotation with Highest Score | 44% | Hard | |
| 0797 | * All Paths From Source to Target | 77% | Medium | |
| 0796 | * Rotate String | 49% | Easy | |
| 0795 | * Number of Subarrays with Bounded Maximum | 46% | Medium | |
| 0794 | * Valid Tic-Tac-Toe State | 32% | Medium | |
| 0793 | * Preimage Size of Factorial Zeroes Function | 40% | Hard | |
| 0792 | * Number of Matching Subsequences | 47% | Medium | |
| 0791 | * Custom Sort String | 65% | Medium | |
| 0790 | * Domino and Tromino Tiling | 39% | Medium | |
| 0789 | * Escape The Ghosts | 57% | Medium | |
| 0788 | * Rotated Digits | 56% | Easy | |
| 0787 | * Cheapest Flights Within K Stops | 39% | Medium | |
| 0786 | * K-th Smallest Prime Fraction | 41% | Hard | |
| 0785 | * Is Graph Bipartite? | 47% | Medium | |
| 0784 | * Letter Case Permutation | 64% | Medium | |
| 0783 | * Minimum Distance Between BST Nodes | 52% | Easy | |
| 0782 | * Transform to Chessboard | 46% | Hard | |
| 0781 | * Rabbits in Forest | 54% | Medium | |
| 0780 | * Reaching Points | 29% | Hard | |
| 0779 | * K-th Symbol in Grammar | 37% | Medium | |
| 0778 | * Swim in Rising Water | 53% | Hard | |
| 0777 | * Swap Adjacent in LR String | 34% | Medium | |
| 0775 | * Global and Local Inversions | 42% | Medium | |
| 0773 | * Sliding Puzzle | 59% | Hard | |
| 0771 | * Jewels and Stones | 86% | Easy | |
| 0770 | * Basic Calculator IV | 48% | Hard | |
| 0769 | * Max Chunks To Make Sorted | 54% | Medium | |
| 0768 | * Max Chunks To Make Sorted II | 48% | Hard | |
| 0767 | * Reorganize String | 48% | Medium | |
| 0766 | * Toeplitz Matrix | 65% | Easy | |
| 0765 | * Couples Holding Hands | 54% | Hard | |
| 0764 | * Largest Plus Sign | 45% | Medium | |
| 0763 | * Partition Labels | 76% | Medium | |
| 0762 | * Prime Number of Set Bits in Binary Representation | 63% | Easy | |
| 0761 | * Special Binary String | 54% | Hard | |
| 0757 | * Set Intersection Size At Least Two | 40% | Hard | |
| 0756 | * Pyramid Transition Matrix | 54% | Medium | |
| 0754 | * Reach a Number | 34% | Medium | |
| 0753 | * Cracking the Safe | 50% | Hard | |
| 0752 | * Open the Lock | 51% | Medium | |
| 0749 | * Contain Virus | 45% | Hard | |
| 0748 | * Shortest Completing Word | 56% | Easy | |
| 0747 | * Largest Number At Least Twice of Others | 42% | Easy | |
| 0746 | * Min Cost Climbing Stairs | 50% | Easy | |
| 0745 | * Prefix and Suffix Search | 34% | Hard | |
| 0744 | * Find Smallest Letter Greater Than Target | 45% | Easy | |
| 0743 | * Network Delay Time | 44% | Medium | |
| 0741 | * Cherry Pickup | 33% | Hard | |
| 0740 | * Delete and Earn | 48% | Medium | |
| 0739 | * Daily Temperatures | 63% | Medium | |
| 0738 | * Monotone Increasing Digits | 44% | Medium | |
| 0736 | * Parse Lisp Expression | 47% | Hard | |
| 0735 | * Asteroid Collision | 41% | Medium | |
| 0733 | * Flood Fill | 55% | Easy | |
| 0732 | * My Calendar III | 60% | Hard | |
| 0731 | * My Calendar II | 49% | Medium | |
| 0730 | * Count Different Palindromic Subsequences | 41% | Hard | |
| 0729 | * My Calendar I | 51% | Medium | |
| 0728 | * Self Dividing Numbers | 74% | Easy | |
| 0726 | * Number of Atoms | 49% | Hard | |
| 0725 | * Split Linked List in Parts | 52% | Medium | |
| 0724 | * Find Pivot Index | 44% | Easy | |
| 0722 | * Remove Comments | 34% | Medium | |
| 0721 | * Accounts Merge | 49% | Medium | |
| 0720 | * Longest Word in Dictionary | 48% | Easy | |
| 0719 | * Find K-th Smallest Pair Distance | 31% | Hard | |
| 0718 | * Maximum Length of Repeated Subarray | 49% | Medium | |
| 0717 | * 1-bit and 2-bit Characters | 48% | Easy | |
| 0715 | * Range Module | 38% | Hard | |
| 0714 | * Best Time to Buy and Sell Stock with Transaction Fee | 54% | Medium | |
| 0713 | * Subarray Product Less Than K | 39% | Medium | |
| 0712 | * Minimum ASCII Delete Sum for Two Strings | 58% | Medium | |
| 0710 | * Random Pick with Blacklist | 32% | Hard | |
| 0709 | * To Lower Case | 79% | Easy | |
| 0707 | * Design Linked List | 24% | Medium | |
| 0706 | * Design HashMap | 61% | Easy | |
| 0705 | * Design HashSet | 64% | Easy | |
| 0704 | * Binary Search | 52% | Easy | |
| 0703 | * Kth Largest Element in a Stream | 49% | Easy | |
| 0701 | * Insert into a Binary Search Tree | 77% | Medium | |
| 0700 | * Search in a Binary Search Tree | 73% | Easy | |
| 0699 | * Falling Squares | 41% | Hard | |
| 0698 | * Partition to K Equal Sum Subsets | 44% | Medium | |
| 0697 | * Degree of an Array | 53% | Easy | |
| 0696 | * Count Binary Substrings | 56% | Easy | |
| 0695 | * Max Area of Island | 62% | Medium | |
| 0693 | * Binary Number with Alternating Bits | 59% | Easy | |
| 0692 | * Top K Frequent Words | 52% | Medium | |
| 0691 | * Stickers to Spell Word | 42% | Hard | |
| 0689 | * Maximum Sum of 3 Non-Overlapping Subarrays | 46% | Hard | |
| 0688 | * Knight Probability in Chessboard | 49% | Medium | |
| 0687 | * Longest Univalue Path | 36% | Easy | |
| 0686 | * Repeated String Match | 32% | Easy | |
| 0685 | * Redundant Connection II | 32% | Hard | |
| 0684 | * Redundant Connection | 57% | Medium | |
| 0682 | * Baseball Game | 63% | Easy | |
| 0680 | * Valid Palindrome II | 36% | Easy | |
| 0679 | * 24 Game | 46% | Hard | |
| 0678 | * Valid Parenthesis String | 31% | Medium | |
| 0677 | * Map Sum Pairs | 53% | Medium | |
| 0676 | * Implement Magic Dictionary | 54% | Medium | |
| 0675 | * Cut Off Trees for Golf Event | 34% | Hard | |
| 0674 | * Longest Continuous Increasing Subsequence | 45% | Easy | |
| 0673 | * Number of Longest Increasing Subsequence | 35% | Medium | |
| 0672 | * Bulb Switcher II | 50% | Medium | |
| 0671 | * Second Minimum Node In a Binary Tree | 42% | Easy | |
| 0670 | * Maximum Swap | 43% | Medium | |
| 0669 | * Trim a Binary Search Tree | 63% | Easy | |
| 0668 | * Kth Smallest Number in Multiplication Table | 46% | Hard | |
| 0667 | * Beautiful Arrangement II | 54% | Medium | |
| 0665 | * Non-decreasing Array | 19% | Easy | |
| 0664 | * Strange Printer | 40% | Hard | |
| 0662 | * Maximum Width of Binary Tree | 40% | Medium | |
| 0661 | * Image Smoother | 51% | Easy | |
| 0659 | * Split Array into Consecutive Subsequences | 43% | Medium | |
| 0658 | * Find K Closest Elements | 41% | Medium | |
| 0657 | * Robot Return to Origin | 73% | Easy | |
| 0655 | * Print Binary Tree | 55% | Medium | |
| 0654 | * Maximum Binary Tree | 79% | Medium | |
| 0653 | * Two Sum IV - Input is a BST | 55% | Easy | |
| 0652 | * Find Duplicate Subtrees | 50% | Medium | |
| 0650 | * 2 Keys Keyboard | 49% | Medium | |
| 0649 | * Dota2 Senate | 39% | Medium | |
| 0648 | * Replace Words | 56% | Medium | |
| 0647 | * Palindromic Substrings | 60% | Medium | |
| 0646 | * Maximum Length of Pair Chain | 52% | Medium | |
| 0645 | * Set Mismatch | 42% | Easy | |
| 0643 | * Maximum Average Subarray I | 41% | Easy | |
| 0641 | * Design Circular Deque | 52% | Medium | |
| 0640 | * Solve the Equation | 42% | Medium | |
| 0639 | * Decode Ways II | 26% | Hard | |
| 0638 | * Shopping Offers | 51% | Medium | |
| 0637 | * Average of Levels in Binary Tree | 63% | Easy | |
| 0636 | * Exclusive Time of Functions | 52% | Medium | |
| 0633 | * Sum of Square Numbers | 32% | Easy | |
| 0632 | * Smallest Range Covering Elements from K Lists | 52% | Hard | |
| 0630 | * Course Schedule III | 33% | Hard | |
| 0629 | * K Inverse Pairs Array | 31% | Hard | |
| 0628 | * Maximum Product of Three Numbers | 47% | Easy | |
| 0623 | * Add One Row to Tree | 49% | Medium | |
| 0622 | * Design Circular Queue | 43% | Medium | |
| 0621 | * Task Scheduler | 50% | Medium | |
| 0617 | * Merge Two Binary Trees | 74% | Easy | |
| 0611 | * Valid Triangle Number | 48% | Medium | |
| 0609 | * Find Duplicate File in System | 59% | Medium | |
| 0606 | * Construct String from Binary Tree | 54% | Easy | |
| 0605 | * Can Place Flowers | 31% | Easy | |
| 0600 | * Non-negative Integers without Consecutive Ones | 34% | Hard | |
| 0599 | * Minimum Index Sum of Two Lists | 50% | Easy | |
| 0598 | * Range Addition II | 49% | Easy | |
| 0594 | * Longest Harmonious Subsequence | 46% | Easy | |
| 0593 | * Valid Square | 43% | Medium | |
| 0592 | * Fraction Addition and Subtraction | 49% | Medium | |
| 0591 | * Tag Validator | 34% | Hard | |
| 0587 | * Erect the Fence | 35% | Hard | |
| 0583 | * Delete Operation for Two Strings | 48% | Medium | |
| 0581 | * Shortest Unsorted Continuous Subarray | 31% | Easy | |
| 0576 | * Out of Boundary Paths | 35% | Medium | |
| 0575 | * Distribute Candies | 61% | Easy | |
| 0572 | * Subtree of Another Tree | 44% | Easy | |
| 0567 | * Permutation in String | 44% | Medium | |
| 0566 | * Reshape the Matrix | 60% | Easy | |
| 0565 | * Array Nesting | 55% | Medium | |
| 0564 | * Find the Closest Palindrome | 19% | Hard | |
| 0563 | * Binary Tree Tilt | 48% | Easy | |
| 0561 | * Array Partition I | 72% | Easy | |
| 0560 | * Subarray Sum Equals K | 43% | Medium | |
| 0557 | * Reverse Words in a String III | 70% | Easy | |
| 0556 | * Next Greater Element III | 31% | Medium | |
| 0554 | * Brick Wall | 50% | Medium | |
| 0553 | * Optimal Division | 56% | Medium | |
| 0552 | * Student Attendance Record II | 36% | Hard | |
| 0551 | * Student Attendance Record I | 45% | Easy | |
| 0547 | * Friend Circles | 58% | Medium | |
| 0546 | * Remove Boxes | 42% | Hard | |
| 0543 | * Diameter of Binary Tree | 48% | Easy | |
| 0542 | * 01 Matrix | 39% | Medium | |
| 0541 | * Reverse String II | 48% | Easy | |
| 0540 | * Single Element in a Sorted Array | 57% | Medium | |
| 0539 | * Minimum Time Difference | 51% | Medium | |
| 0538 | * Convert BST to Greater Tree | 55% | Easy | |
| 0537 | * Complex Number Multiplication | 67% | Medium | |
| 0532 | * K-diff Pairs in an Array | 31% | Easy | |
| 0530 | * Minimum Absolute Difference in BST | 53% | Easy | |
| 0529 | * Minesweeper | 59% | Medium | |
| 0528 | * Random Pick with Weight | 44% | Medium | |
| 0526 | * Beautiful Arrangement | 58% | Medium | |
| 0525 | * Contiguous Array | 42% | Medium | |
| 0524 | * Longest Word in Dictionary through Deleting | 48% | Medium | |
| 0523 | * Continuous Subarray Sum | 24% | Medium | |
| 0522 | * Longest Uncommon Subsequence II | 33% | Medium | |
| 0521 | * Longest Uncommon Subsequence I | 57% | Easy | |
| 0520 | * Detect Capital | 53% | Easy | |
| 0519 | * Random Flip Matrix | 36% | Medium | |
| 0518 | * Coin Change 2 | 50% | Medium | |
| 0517 | * Super Washing Machines | 38% | Hard | |
| 0516 | * Longest Palindromic Subsequence | 53% | Medium | |
| 0515 | * Find Largest Value in Each Tree Row | 61% | Medium | |
| 0514 | * Freedom Trail | 43% | Hard | |
| 0513 | * Find Bottom Left Tree Value | 61% | Medium | |
| 0509 | * Fibonacci Number | 67% | Easy | |
| 0508 | * Most Frequent Subtree Sum | 58% | Medium | |
| 0507 | * Perfect Number | 35% | Easy | |
| 0506 | * Relative Ranks | 50% | Easy | |
| 0504 | * Base 7 | 46% | Easy | |
| 0503 | * Next Greater Element II | 56% | Medium | |
| 0502 | * IPO | 40% | Hard | |
| 0501 | * Find Mode in Binary Search Tree | 42% | Easy | |
| 0500 | * Keyboard Row | 64% | Easy | |
| 0498 | * Diagonal Traverse | 48% | Medium | |
| 0497 | * Random Point in Non-overlapping Rectangles | 38% | Medium | |
| 0496 | * Next Greater Element I | 64% | Easy | |
| 0495 | * Teemo Attacking | 53% | Medium | |
| 0494 | * Target Sum | 46% | Medium | |
| 0493 | * Reverse Pairs | 25% | Hard | |
| 0492 | * Construct the Rectangle | 49% | Easy | |
| 0491 | * Increasing Subsequences | 46% | Medium | |
| 0488 | * Zuma Game | 39% | Hard | |
| 0486 | * Predict the Winner | 47% | Medium | |
| 0485 | * Max Consecutive Ones | 54% | Easy | |
| 0483 | * Smallest Good Base | 35% | Hard | |
| 0482 | * License Key Formatting | 43% | Easy | |
| 0481 | * Magical String | 47% | Medium | |
| 0480 | * Sliding Window Median | 37% | Hard | |
| 0479 | * Largest Palindrome Product | 29% | Hard | |
| 0478 | * Generate Random Point in a Circle | 38% | Medium | |
| 0477 | * Total Hamming Distance | 50% | Medium | |
| 0476 | * Number Complement | 64% | Easy | |
| 0475 | * Heaters | 33% | Easy | |
| 0474 | * Ones and Zeroes | 42% | Medium | |
| 0473 | * Matchsticks to Square | 37% | Medium | |
| 0472 | * Concatenated Words | 43% | Hard | |
| 0470 | * Implement Rand10() Using Rand7() | 46% | Medium | |
| 0468 | * Validate IP Address | 24% | Medium | |
| 0467 | * Unique Substrings in Wraparound String | 35% | Medium | |
| 0466 | * Count The Repetitions | 28% | Hard | |
| 0464 | * Can I Win | 28% | Medium | |
| 0463 | * Island Perimeter | 65% | Easy | |
| 0462 | * Minimum Moves to Equal Array Elements II | 53% | Medium | |
| 0461 | * Hamming Distance | 72% | Easy | |
| 0460 | * LFU Cache | 34% | Hard | |
| 0459 | * Repeated Substring Pattern | 42% | Easy | |
| 0458 | * Poor Pigs | 47% | Hard | |
| 0457 | * Circular Array Loop | 29% | Medium | |
| 0456 | * 132 Pattern | 28% | Medium | |
| 0455 | * Assign Cookies | 49% | Easy | |
| 0454 | * 4Sum II | 53% | Medium | |
| 0453 | * Minimum Moves to Equal Array Elements | 50% | Easy | |
| 0452 | * Minimum Number of Arrows to Burst Balloons | 49% | Medium | |
| 0451 | * Sort Characters By Frequency | 63% | Medium | |
| 0450 | * Delete Node in a BST | 43% | Medium | |
| 0448 | * Find All Numbers Disappeared in an Array | 55% | Easy | |
| 0447 | * Number of Boomerangs | 51% | Easy | |
| 0446 | * Arithmetic Slices II - Subsequence | 32% | Hard | |
| 0445 | * Add Two Numbers II | 54% | Medium | |
| 0443 | * String Compression | 41% | Easy | |
| 0442 | * Find All Duplicates in an Array | 67% | Medium | |
| 0441 | * Arranging Coins | 41% | Easy | |
| 0440 | * K-th Smallest in Lexicographical Order | 29% | Hard | |
| 0438 | * Find All Anagrams in a String | 43% | Medium | |
| 0437 | * Path Sum III | 47% | Medium | |
| 0436 | * Find Right Interval | 47% | Medium | |
| 0435 | * Non-overlapping Intervals | 43% | Medium | |
| 0434 | * Number of Segments in a String | 37% | Easy | |
| 0433 | * Minimum Genetic Mutation | 41% | Medium | |
| 0432 | * All O`one Data Structure | 32% | Hard | |
| 0424 | * Longest Repeating Character Replacement | 47% | Medium | |
| 0423 | * Reconstruct Original Digits from English | 46% | Medium | |
| 0421 | * Maximum XOR of Two Numbers in an Array | 53% | Medium | |
| 0420 | * Strong Password Checker | 13% | Hard | |
| 0419 | * Battleships in a Board | 70% | Medium | |
| 0417 | * Pacific Atlantic Water Flow | 41% | Medium | |
| 0416 | * Partition Equal Subset Sum | 43% | Medium | |
| 0415 | * Add Strings | 47% | Easy | |
| 0414 | * Third Maximum Number | 30% | Easy | |
| 0413 | * Arithmetic Slices | 58% | Medium | |
| 0412 | * Fizz Buzz | 63% | Easy | |
| 0410 | * Split Array Largest Sum | 44% | Hard | |
| 0409 | * Longest Palindrome | 51% | Easy | |
| 0407 | * Trapping Rain Water II | 42% | Hard | |
| 0406 | * Queue Reconstruction by Height | 66% | Medium | |
| 0405 | * Convert a Number to Hexadecimal | 43% | Easy | |
| 0404 | * Sum of Left Leaves | 51% | Easy | |
| 0403 | * Frog Jump | 39% | Hard | |
| 0402 | * Remove K Digits | 28% | Medium | |
| 0401 | * Binary Watch | 47% | Easy | |
| 0400 | * Nth Digit | 31% | Medium | |
| 0399 | * Evaluate Division | 51% | Medium | |
| 0398 | * Random Pick Index | 56% | Medium | |
| 0397 | * Integer Replacement | 32% | Medium | |
| 0396 | * Rotate Function | 36% | Medium | |
| 0395 | * Longest Substring with At Least K Repeating Characters | 41% | Medium | |
| 0394 | * Decode String | 50% | Medium | |
| 0393 | * UTF-8 Validation | 37% | Medium | |
| 0392 | * Is Subsequence | 49% | Easy | |
| 0391 | * Perfect Rectangle | 30% | Hard | |
| 0390 | * Elimination Game | 44% | Medium | |
| 0389 | * Find the Difference | 55% | Easy | |
| 0388 | * Longest Absolute File Path | 41% | Medium | |
| 0387 | * First Unique Character in a String | 53% | Easy | |
| 0386 | * Lexicographical Numbers | 51% | Medium | |
| 0385 | * Mini Parser | 33% | Medium | |
| 0384 | * Shuffle an Array | 52% | Medium | |
| 0383 | * Ransom Note | 53% | Easy | |
| 0382 | * Linked List Random Node | 52% | Medium | |
| 0381 | * Insert Delete GetRandom O(1) - Duplicates allowed | 34% | Hard | |
| 0380 | * Insert Delete GetRandom O(1) | 47% | Medium | |
| 0378 | * Kth Smallest Element in a Sorted Matrix | 54% | Medium | |
| 0377 | * Combination Sum IV | 45% | Medium | |
| 0376 | * Wiggle Subsequence | 39% | Medium | |
| 0375 | * Guess Number Higher or Lower II | 40% | Medium | |
| 0373 | * Find K Pairs with Smallest Sums | 36% | Medium | |
| 0372 | * Super Pow | 36% | Medium | |
| 0371 | * Sum of Two Integers | 50% | Medium | |
| 0368 | * Largest Divisible Subset | 37% | Medium | |
| 0367 | * Valid Perfect Square | 41% | Easy | |
| 0365 | * Water and Jug Problem | 30% | Medium | |
| 0363 | * Max Sum of Rectangle No Larger Than K | 37% | Hard | |
| 0357 | * Count Numbers with Unique Digits | 48% | Medium | |
| 0355 | * Design Twitter | 30% | Medium | |
| 0354 | * Russian Doll Envelopes | 35% | Hard | |
| 0352 | * Data Stream as Disjoint Intervals | 47% | Hard | |
| 0350 | * Intersection of Two Arrays II | 51% | Easy | |
| 0349 | * Intersection of Two Arrays | 62% | Easy | |
| 0347 | * Top K Frequent Elements | 61% | Medium | |
| 0345 | * Reverse Vowels of a String | 44% | Easy | |
| 0344 | * Reverse String | 68% | Easy | |
| 0343 | * Integer Break | 50% | Medium | |
| 0342 | * Power of Four | 41% | Easy | |
| 0338 | * Counting Bits | 69% | Medium | |
| 0337 | * House Robber III | 50% | Medium | |
| 0336 | * Palindrome Pairs | 33% | Hard | |
| 0335 | * Self Crossing | 28% | Hard | |
| 0334 | * Increasing Triplet Subsequence | 39% | Medium | |
| 0332 | * Reconstruct Itinerary | 36% | Medium | |
| 0331 | * Verify Preorder Serialization of a Binary Tree | 40% | Medium | |
| 0330 | * Patching Array | 34% | Hard | |
| 0329 | * Longest Increasing Path in a Matrix | 43% | Hard | |
| 0328 | * Odd Even Linked List | 55% | Medium | |
| 0327 | * Count of Range Sum | 35% | Hard | |
| 0326 | * Power of Three | 42% | Easy | |
| 0324 | * Wiggle Sort II | 29% | Medium | |
| 0322 | * Coin Change | 35% | Medium | |
| 0321 | * Create Maximum Number | 27% | Hard | |
| 0319 | * Bulb Switcher | 45% | Medium | |
| 0318 | * Maximum Product of Word Lengths | 51% | Medium | |
| 0316 | * Remove Duplicate Letters | 35% | Hard | |
| 0315 | * Count of Smaller Numbers After Self | 41% | Hard | |
| 0313 | * Super Ugly Number | 45% | Medium | |
| 0312 | * Burst Balloons | 51% | Hard | |
| 0310 | * Minimum Height Trees | 32% | Medium | |
| 0309 | * Best Time to Buy and Sell Stock with Cooldown | 47% | Medium | |
| 0307 | * Range Sum Query - Mutable | 34% | Medium | |
| 0306 | * Additive Number | 29% | Medium | |
| 0304 | * Range Sum Query 2D - Immutable | 38% | Medium | |
| 0303 | * Range Sum Query - Immutable | 45% | Easy | |
| 0301 | * Remove Invalid Parentheses | 43% | Hard | |
| 0300 | * Longest Increasing Subsequence | 42% | Medium | |
| 0299 | * Bulls and Cows | 42% | Easy | |
| 0295 | * Find Median from Data Stream | 44% | Hard | |
| 0292 | * Nim Game | 54% | Easy | |
| 0290 | * Word Pattern | 37% | Easy | |
| 0289 | * Game of Life | 54% | Medium | |
| 0287 | * Find the Duplicate Number | 55% | Medium | |
| 0283 | * Move Zeroes | 57% | Easy | |
| 0282 | * Expression Add Operators | 35% | Hard | |
| 0279 | * Perfect Squares | 47% | Medium | |
| 0275 | * H-Index II | 36% | Medium | |
| 0274 | * H-Index | 36% | Medium | |
| 0273 | * Integer to English Words | 27% | Hard | |
| 0268 | * Missing Number | 51% | Easy | |
| 0264 | * Ugly Number II | 42% | Medium | |
| 0263 | * Ugly Number | 41% | Easy | |
| 0260 | * Single Number III | 64% | Medium | |
| 0258 | * Add Digits | 57% | Easy | |
| 0257 | * Binary Tree Paths | 51% | Easy | |
| 0242 | * Valid Anagram | 57% | Easy | |
| 0241 | * Different Ways to Add Parentheses | 55% | Medium | |
| 0240 | * Search a 2D Matrix II | 43% | Medium | |
| 0239 | * Sliding Window Maximum | 43% | Hard | |
| 0238 | * Product of Array Except Self | 60% | Medium | |
| 0237 | * Delete Node in a Linked List | 64% | Easy | |
| 0236 | * Lowest Common Ancestor of a Binary Tree | 46% | Medium | |
| 0235 | * Lowest Common Ancestor of a Binary Search Tree | 50% | Easy | |
| 0234 | * Palindrome Linked List | 39% | Easy | |
| 0233 | * Number of Digit One | 31% | Hard | |
| 0232 | * Implement Queue using Stacks | 49% | Easy | |
| 0231 | * Power of Two | 43% | Easy | |
| 0230 | * Kth Smallest Element in a BST | 60% | Medium | |
| 0229 | * Majority Element II | 35% | Medium | |
| 0228 | * Summary Ranges | 39% | Medium | |
| 0227 | * Basic Calculator II | 37% | Medium | |
| 0226 | * Invert Binary Tree | 65% | Easy | |
| 0225 | * Implement Stack using Queues | 45% | Easy | |
| 0224 | * Basic Calculator | 36% | Hard | |
| 0223 | * Rectangle Area | 37% | Medium | |
| 0222 | * Count Complete Tree Nodes | 47% | Medium | |
| 0221 | * Maximal Square | 37% | Medium | |
| 0220 | * Contains Duplicate III | 20% | Medium | |
| 0219 | * Contains Duplicate II | 37% | Easy | |
| 0218 | * The Skyline Problem | 34% | Hard | |
| 0217 | * Contains Duplicate | 56% | Easy | |
| 0216 | * Combination Sum III | 56% | Medium | |
| 0215 | * Kth Largest Element in an Array | 55% | Medium | |
| 0214 | * Shortest Palindrome | 29% | Hard | |
| 0213 | * House Robber II | 36% | Medium | |
| 0212 | * Word Search II | 35% | Hard | |
| 0211 | * Design Add and Search Words Data Structure | 38% | Medium | |
| 0210 | * Course Schedule II | 40% | Medium | |
| 0209 | * Minimum Size Subarray Sum | 38% | Medium | |
| 0208 | * Implement Trie (Prefix Tree) | 49% | Medium | |
| 0207 | * Course Schedule | 43% | Medium | |
| 0206 | * Reverse Linked List | 62% | Easy | |
| 0205 | * Isomorphic Strings | 39% | Easy | |
| 0204 | * Count Primes | 31% | Easy | |
| 0203 | * Remove Linked List Elements | 38% | Easy | |
| 0202 | * Happy Number | 50% | Easy | |
| 0201 | * Bitwise AND of Numbers Range | 39% | Medium | |
| 0200 | * Number of Islands | 46% | Medium | |
| 0199 | * Binary Tree Right Side View | 54% | Medium | |
| 0198 | * House Robber | 42% | Easy | |
| 0191 | * Number of 1 Bits | 50% | Easy | |
| 0190 | * Reverse Bits | 40% | Easy | |
| 0189 | * Rotate Array | 34% | Easy | |
| 0188 | * Best Time to Buy and Sell Stock IV | 28% | Hard | |
| 0187 | * Repeated DNA Sequences | 38% | Medium | |
| 0179 | * Largest Number | 28% | Medium | |
| 0174 | * Dungeon Game | 32% | Hard | |
| 0173 | * Binary Search Tree Iterator | 56% | Medium | |
| 0172 | * Factorial Trailing Zeroes | 37% | Easy | |
| 0171 | * Excel Sheet Column Number | 56% | Easy | |
| 0169 | * Majority Element | 58% | Easy | |
| 0168 | * Excel Sheet Column Title | 31% | Easy | |
| 0167 | * Two Sum II - Input array is sorted | 54% | Easy | |
| 0166 | * Fraction to Recurring Decimal | 21% | Medium | |
| 0165 | * Compare Version Numbers | 27% | Medium | |
| 0164 | * Maximum Gap | 35% | Hard | |
| 0162 | * Find Peak Element | 43% | Medium | |
| 0160 | * Intersection of Two Linked Lists | 40% | Easy | |
| 0155 | * Min Stack | 44% | Easy | |
| 0154 | * Find Minimum in Rotated Sorted Array II | 41% | Hard | |
| 0153 | * Find Minimum in Rotated Sorted Array | 45% | Medium | |
| 0152 | * Maximum Product Subarray | 31% | Medium | |
| 0150 | * Evaluate Reverse Polish Notation | 36% | Medium | |
| 0149 | * Max Points on a Line | 16% | Hard | |
| 0148 | * Sort List | 42% | Medium | |
| 0147 | * Insertion Sort List | 41% | Medium | |
| 0146 | * LRU Cache | 33% | Medium | |
| 0145 | * Binary Tree Postorder Traversal | 55% | Hard | |
| 0144 | * Binary Tree Preorder Traversal | 55% | Medium | |
| 0143 | * Reorder List | 38% | Medium | |
| 0142 | * Linked List Cycle II | 37% | Medium | |
| 0141 | * Linked List Cycle | 41% | Easy | |
| 0140 | * Word Break II | 32% | Hard | |
| 0139 | * Word Break | 40% | Medium | |
| 0137 | * Single Number II | 52% | Medium | |
| 0136 | * Single Number | 65% | Easy | |
| 0135 | * Candy | 31% | Hard | |
| 0134 | * Gas Station | 38% | Medium | |
| 0132 | * Palindrome Partitioning II | 30% | Hard | |
| 0131 | * Palindrome Partitioning | 47% | Medium | |
| 0130 | * Surrounded Regions | 28% | Medium | |
| 0129 | * Sum Root to Leaf Numbers | 49% | Medium | |
| 0128 | * Longest Consecutive Sequence | 45% | Hard | |
| 0127 | * Word Ladder | 29% | Medium | |
| 0126 | * Word Ladder II | 22% | Hard | |
| 0125 | * Valid Palindrome | 36% | Easy | |
| 0124 | * Binary Tree Maximum Path Sum | 34% | Hard | |
| 0123 | * Best Time to Buy and Sell Stock III | 38% | Hard | |
| 0122 | * Best Time to Buy and Sell Stock II | 57% | Easy | |
| 0121 | * Best Time to Buy and Sell Stock | 50% | Easy | |
| 0120 | * Triangle | 44% | Medium | |
| 0119 | * Pascal's Triangle II | 50% | Easy | |
| 0118 | * Pascal's Triangle | 52% | Easy | |
| 0115 | * Distinct Subsequences | 38% | Hard | |
| 0114 | * Flatten Binary Tree to Linked List | 49% | Medium | |
| 0113 | * Path Sum II | 46% | Medium | |
| 0112 | * Path Sum | 41% | Easy | |
| 0111 | * Minimum Depth of Binary Tree | 37% | Easy | |
| 0110 | * Balanced Binary Tree | 43% | Easy | |
| 0109 | * Convert Sorted List to Binary Search Tree | 47% | Medium | |
| 0108 | * Convert Sorted Array to Binary Search Tree | 58% | Easy | |
| 0107 | * Binary Tree Level Order Traversal II | 53% | Easy | |
| 0106 | * Construct Binary Tree from Inorder and Postorder Traversal | 47% | Medium | |
| 0105 | * Construct Binary Tree from Preorder and Inorder Traversal | 49% | Medium | |
| 0104 | * Maximum Depth of Binary Tree | 66% | Easy | |
| 0103 | * Binary Tree Zigzag Level Order Traversal | 48% | Medium | |
| 0102 | * Binary Tree Level Order Traversal | 54% | Medium | |
| 0101 | * Symmetric Tree | 46% | Easy | |
| 0100 | * Same Tree | 53% | Easy | |
| 0099 | * Recover Binary Search Tree | 39% | Hard | |
| 0098 | * Validate Binary Search Tree | 27% | Medium | |
| 0097 | * Interleaving String | 31% | Hard | |
| 0096 | * Unique Binary Search Trees | 53% | Medium | |
| 0095 | * Unique Binary Search Trees II | 40% | Medium | |
| 0094 | * Binary Tree Inorder Traversal | 63% | Medium | |
| 0093 | * Restore IP Addresses | 35% | Medium | |
| 0092 | * Reverse Linked List II | 39% | Medium | |
| 0091 | * Decode Ways | 24% | Medium | |
| 0090 | * Subsets II | 47% | Medium | |
| 0089 | * Gray Code | 49% | Medium | |
| 0088 | * Merge Sorted Array | 39% | Easy | |
| 0087 | * Scramble String | 33% | Hard | |
| 0086 | * Partition List | 41% | Medium | |
| 0085 | * Maximal Rectangle | 37% | Hard | |
| 0084 | * Largest Rectangle in Histogram | 35% | Hard | |
| 0083 | * Remove Duplicates from Sorted List | 45% | Easy | |
| 0082 | * Remove Duplicates from Sorted List II | 37% | Medium | |
| 0081 | * Search in Rotated Sorted Array II | 33% | Medium | |
| 0080 | * Remove Duplicates from Sorted Array II | 44% | Medium | |
| 0079 | * Word Search | 35% | Medium | |
| 0078 | * Subsets | 62% | Medium | |
| 0077 | * Combinations | 54% | Medium | |
| 0076 | * Minimum Window Substring | 34% | Hard | |
| 0075 | * Sort Colors | 47% | Medium | |
| 0074 | * Search a 2D Matrix | 36% | Medium | |
| 0073 | * Set Matrix Zeroes | 43% | Medium | |
| 0072 | * Edit Distance | 45% | Hard | |
| 0071 | * Simplify Path | 32% | Medium | |
| 0070 | * Climbing Stairs | 47% | Easy | |
| 0069 | * Sqrt(x) | 34% | Easy | |
| 0068 | * Text Justification | 27% | Hard | |
| 0067 | * Add Binary | 45% | Easy | |
| 0066 | * Plus One | 42% | Easy | |
| 0065 | * Valid Number | 15% | Hard | |
| 0064 | * Minimum Path Sum | 54% | Medium | |
| 0063 | * Unique Paths II | 34% | Medium | |
| 0062 | * Unique Paths | 54% | Medium | |
| 0061 | * Rotate List | 30% | Medium | |
| 0060 | * Permutation Sequence | 38% | Hard | |
| 0059 | * Spiral Matrix II | 54% | Medium | |
| 0058 | * Length of Last Word | 32% | Easy | |
| 0057 | * Insert Interval | 33% | Hard | |
| 0056 | * Merge Intervals | 39% | Medium | |
| 0055 | * Jump Game | 34% | Medium | |
| 0054 | * Spiral Matrix | 34% | Medium | |
| 0053 | * Maximum Subarray | 46% | Easy | |
| 0052 | * N-Queens II | 58% | Hard | |
| 0051 | * N-Queens | 46% | Hard | |
| 0050 | * Pow(x, n) | 30% | Medium | |
| 0049 | * Group Anagrams | 57% | Medium | |
| 0048 | * Rotate Image | 57% | Medium | |
| 0047 | * Permutations II | 46% | Medium | |
| 0046 | * Permutations | 63% | Medium | |
| 0045 | * Jump Game II | 30% | Hard | |
| 0044 | * Wildcard Matching | 24% | Hard | |
| 0043 | * Multiply Strings | 34% | Medium | |
| 0042 | * Trapping Rain Water | 49% | Hard | |
| 0041 | * First Missing Positive | 32% | Hard | |
| 0040 | * Combination Sum II | 48% | Medium | |
| 0039 | * Combination Sum | 56% | Medium | |
| 0038 | * Count and Say | 44% | Easy | |
| 0037 | * Sudoku Solver | 43% | Hard | |
| 0036 | * Valid Sudoku | 48% | Medium | |
| 0035 | * Search Insert Position | 42% | Easy | |
| 0034 | * Find First and Last Position of Element in Sorted Array | 36% | Medium | |
| 0033 | * Search in Rotated Sorted Array | 34% | Medium | |
| 0032 | * Longest Valid Parentheses | 28% | Hard | |
| 0031 | * Next Permutation | 32% | Medium | |
| 0030 | * Substring with Concatenation of All Words | 25% | Hard | |
| 0029 | * Divide Two Integers | 16% | Medium | |
| 0028 | * Implement strStr() | 34% | Easy | |
| 0027 | * Remove Element | 48% | Easy | |
| 0026 | * Remove Duplicates from Sorted Array | 45% | Easy | |
| 0025 | * Reverse Nodes in k-Group | 42% | Hard | |
| 0024 | * Swap Nodes in Pairs | 50% | Medium | |
| 0023 | * Merge k Sorted Lists | 40% | Hard | |
| 0022 | * Generate Parentheses | 62% | Medium | |
| 0021 | * Merge Two Sorted Lists | 53% | Easy | |
| 0020 | * Valid Parentheses | 39% | Easy | |
| 0019 | * Remove Nth Node From End of List | 35% | Medium | |
| 0018 | * 4Sum | 33% | Medium | |
| 0017 | * Letter Combinations of a Phone Number | 47% | Medium | |
| 0016 | * 3Sum Closest | 46% | Medium | |
| 0015 | * 3Sum | 26% | Medium | |
| 0014 | Longest Common Prefix | 35% | Easy | |
| 0013 | * Roman to Integer | 55% | Easy | |
| 0012 | * Integer to Roman | 55% | Medium | |
| 0011 | * Container With Most Water | 51% | Medium | |
| 0010 | * Regular Expression Matching | 26% | Hard | |
| 0009 | * Palindrome Number | 48% | Easy | |
| 0008 | * String to Integer (atoi) | 15% | Medium | |
| 0007 | * Reverse Integer | 25% | Easy | |
| 0006 | * ZigZag Conversion | 36% | Medium | |
| 0005 | * Longest Palindromic Substring | 29% | Medium | |
| 0004 | * Median of Two Sorted Arrays | 29% | Hard | |
| 0003 | * Longest Substring Without Repeating Characters | 30% | Medium | |
| 0002 | * Add Two Numbers | 34% | Medium | |
| 0001 | Two Sum | 45% | Easy |
以下免费的算法题，暂时不能提交 Go 解答
- 116.Populating Next Right Pointers in Each Node
- 117.Populating Next Right Pointers in Each Node II
- 133.Clone Graph
- 138.Copy List with Random Pointer
- 151.Reverse Words in a String
- 278.First Bad Version
- 284.Peeking Iterator
- 297.Serialize and Deserialize Binary Tree
- 341.Flatten Nested List Iterator
- 374.Guess Number Higher or Lower
- 426.Convert Binary Search Tree to Sorted Doubly Linked List
- 427.Construct Quad Tree
- 429.N-ary Tree Level Order Traversal
- 430.Flatten a Multilevel Doubly Linked List
- 449.Serialize and Deserialize BST
- 535.Encode and Decode TinyURL
- 558.Logical OR of Two Binary Grids Represented as Quad-Trees
- 559.Maximum Depth of N-ary Tree
- 589.N-ary Tree Preorder Traversal
- 590.N-ary Tree Postorder Traversal
- 690.Employee Importance
- 708.Insert into a Sorted Circular Linked List
helper
helper 会处理大部分琐碎的工作。
notes
notes 记录了我答题过程中，对知识点的总结。
kit
针对 LeetCode 中经常出现的以下数据结构，在 kit 中进行了定义，并添加了与 []int 相互转换的函数。利用 Go 1.9 添加的 type alias 功能，易于添加单元测试。
致谢
感谢所有贡献者的辛苦付出
感谢 JetBrains
Directories
¶
| Path | Synopsis |
|---|---|
|
Algorithms
module
|
|
|
algorithms04
|
|
|
gragh
Package gragh provides Gragh Interface
|
Package gragh provides Gragh Interface |
|
hashtables
Package st provides Hash Tables
|
Package st provides Hash Tables |
|
routine
|
|
Click to show internal directories.
Click to hide internal directories.