| 1 | Two Sum | Easy | 1116 | arrayhash-table |
| 2 | Add Two Numbers | Medium | 1395 | linked-listmathrecursion |
| 3 | Longest Substring Without Repeating Characters | Medium | 1533 | hash-tablestringsliding-window |
| 4 | Median of Two Sorted Arrays | Hard | 2028 | arraybinary-searchdivide-and-conquer |
| 5 | Longest Palindromic Substring | Medium | 1581 | two-pointersstringdynamic-programming |
| 6 | Zigzag Conversion | Medium | 1568 | string |
| 7 | Reverse Integer | Medium | 1413 | math |
| 8 | String to Integer (atoi) | Medium | 1545 | string |
| 9 | Palindrome Number | Easy | 1168 | math |
| 10 | Regular Expression Matching | Hard | 2025 | stringdynamic-programmingrecursion |
| 11 | Container With Most Water | Medium | 1704 | arraytwo-pointersgreedy |
| 12 | Integer to Roman | Medium | 1433 | hash-tablemathstring |
| 13 | Roman to Integer | Easy | 1258 | hash-tablemathstring |
| 14 | Longest Common Prefix | Easy | 1170 | stringtrie |
| 15 | 3Sum | Medium | 1711 | arraytwo-pointerssorting |
| 16 | 3Sum Closest | Medium | 1502 | arraytwo-pointerssorting |
| 17 | Letter Combinations of a Phone Number | Medium | 1460 | hash-tablestringbacktracking |
| 18 | 4Sum | Medium | 1639 | arraytwo-pointerssorting |
| 19 | Remove Nth Node From End of List | Medium | 1474 | linked-listtwo-pointers |
| 20 | Valid Parentheses | Easy | 1211 | stringstack |
| 21 | Merge Two Sorted Lists | Easy | 1168 | linked-listrecursion |
| 22 | Generate Parentheses | Medium | 1648 | stringdynamic-programmingbacktracking |
| 23 | Merge K Sorted Lists | Hard | 1893 | linked-listdivide-and-conquerheap-priority-queue+1 |
| 25 | Reverse Nodes in k-Group | Hard | 2011 | linked-listrecursion |
| 26 | Remove Duplicates from Sorted Array | Easy | 1169 | arraytwo-pointers |
| 27 | Remove Element | Easy | 1153 | arraytwo-pointers |
| 28 | Find the Index of the First Occurrence in a String | Easy | 1302 | two-pointersstringstring-matching |
| 30 | Substring with Concatenation of All Words | Hard | 2039 | hash-tablestringsliding-window |
| 31 | Next Permutation | Medium | 1560 | arraytwo-pointers |
| 32 | Longest Valid Parentheses | Hard | 2118 | stringdynamic-programmingstack |
| 33 | Search in Rotated Sorted Array | Medium | 1625 | arraybinary-search |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | 1483 | arraybinary-search |
| 35 | Search Insert Position | Easy | 1164 | arraybinary-search |
| 36 | Valid Sudoku | Medium | 1422 | arrayhash-tablematrix |
| 37 | Sudoku Solver | Hard | 2313 | arrayhash-tablebacktracking+1 |
| 39 | Combination Sum | Medium | 1469 | arraybacktracking |
| 40 | Combination Sum II | Medium | 1562 | arraybacktracking |
| 41 | First Missing Positive | Hard | 1944 | arrayhash-table |
| 42 | Trapping Rain Water | Hard | 2062 | arraytwo-pointersdynamic-programming+2 |
| 43 | Multiply Strings | Medium | 1499 | mathstringsimulation |
| 44 | Wildcard Matching | Hard | 2100 | stringdynamic-programminggreedy+1 |
| 45 | Jump Game II | Medium | 1618 | arraydynamic-programminggreedy |
| 46 | Permutations | Medium | 1519 | arraybacktracking |
| 47 | Permutations II | Medium | 1574 | arraybacktracking |
| 48 | Rotate Image | Medium | 1407 | arraymathmatrix |
| 49 | Group Anagrams | Medium | 1474 | arrayhash-tablestring+1 |
| 50 | Pow(x, n) | Medium | 1460 | mathrecursion |
| 51 | N-Queens | Hard | 1797 | arraybacktracking |
| 52 | N-Queens II | Hard | 1843 | backtracking |
| 53 | Maximum Subarray | Medium | 1409 | arraydynamic-programmingdivide-and-conquer |
| 54 | Spiral Matrix | Medium | 1524 | arraymatrixsimulation |
| 55 | Jump Game | Medium | 1565 | arraydynamic-programminggreedy |
| 56 | Merge Intervals | Medium | 1551 | arraysorting |
| 57 | Insert Interval | Medium | 1541 | array |
| 58 | Length of Last Word | Easy | 1156 | string |
| 60 | Permutation Sequence | Hard | 1953 | mathrecursion |
| 61 | Rotate List | Medium | 1558 | linked-listtwo-pointers |
| 62 | Unique Paths | Medium | 1383 | mathdynamic-programmingcombinatorics |
| 63 | Unique Paths II | Medium | 1400 | arraydynamic-programmingmatrix |
| 64 | Minimum Path Sum | Medium | 1444 | arraydynamic-programmingmatrix |
| 65 | Valid Number | Hard | 1892 | string |
| 66 | Plus One | Easy | 1151 | arraymath |
| 67 | Add Binary | Easy | 1160 | mathstringbit-manipulation+1 |
| 68 | Text Justification | Hard | 1657 | arraystringsimulation |
| 69 | Sqrt(x) | Easy | 1178 | mathbinary-search |
| 70 | Climbing Stairs | Easy | 1232 | mathdynamic-programmingmemoization |
| 71 | Simplify Path | Medium | 1532 | stringstack |
| 72 | Edit Distance | Medium | 1703 | stringdynamic-programming |
| 73 | Set Matrix Zeroes | Medium | 1390 | arrayhash-tablematrix |
| 74 | Search a 2D Matrix | Medium | 1478 | arraybinary-searchmatrix |
| 75 | Sort Colors | Medium | 1381 | arraytwo-pointerssorting |
| 76 | Minimum Window Substring | Hard | 1890 | hash-tablestringsliding-window |
| 77 | Combinations | Medium | 1483 | backtracking |
| 78 | Subsets | Medium | 1416 | arraybacktrackingbit-manipulation |
| 79 | Word Search | Medium | 1700 | arraystringbacktracking+1 |
| 80 | Remove Duplicates from Sorted Array II | Medium | 1381 | arraytwo-pointers |
| 82 | Remove Duplicates from Sorted List II | Medium | 1509 | linked-listtwo-pointers |
| 83 | Remove Duplicates from Sorted List | Easy | 1169 | linked-list |
| 84 | Largest Rectangle in Histogram | Hard | 1949 | arraystackmonotonic-stack |
| 85 | Maximal Rectangle | Hard | 2188 | arraydynamic-programmingstack+2 |
| 86 | Partition List | Medium | 1519 | linked-listtwo-pointers |
| 87 | Scramble String | Hard | 2264 | stringdynamic-programming |
| 88 | Merge Sorted Array | Easy | 1165 | arraytwo-pointerssorting |
| 90 | Subsets II | Medium | 1517 | arraybacktrackingbit-manipulation |
| 91 | Decode Ways | Medium | 1635 | stringdynamic-programming |
| 92 | Reverse Linked List II | Medium | 1559 | linked-list |
| 94 | Binary Tree Inorder Traversal | Easy | 1250 | stacktreedepth-first-search+1 |
| 97 | Interleaving String | Medium | 1785 | stringdynamic-programming |
| 98 | Validate Binary Search Tree | Medium | 1490 | treedepth-first-searchbinary-search-tree+1 |
| 100 | Same Tree | Easy | 1176 | treedepth-first-searchbreadth-first-search+1 |
| 101 | Symmetric Tree | Easy | 1200 | treedepth-first-searchbreadth-first-search+1 |
| 102 | Binary Tree Level Order Traversal | Medium | 1308 | treebreadth-first-searchbinary-tree |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | 1576 | treebreadth-first-searchbinary-tree |
| 104 | Maximum Depth of Binary Tree | Easy | 1116 | treedepth-first-searchbreadth-first-search+1 |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | 1643 | arrayhash-tabledivide-and-conquer+2 |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | 1660 | arrayhash-tabledivide-and-conquer+2 |
| 107 | Binary Tree Level Order Traversal II | Medium | 1436 | treebreadth-first-searchbinary-tree |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | 1281 | arraydivide-and-conquertree+2 |
| 110 | Balanced Binary Tree | Easy | 1194 | treedepth-first-searchbinary-tree |
| 111 | Minimum Depth of Binary Tree | Easy | 1248 | treedepth-first-searchbreadth-first-search+1 |
| 112 | Path Sum | Easy | 1181 | treedepth-first-searchbreadth-first-search+1 |
| 114 | Flatten Binary Tree to Linked List | Medium | 1519 | linked-liststacktree+2 |
| 115 | Distinct Subsequences | Hard | 1849 | stringdynamic-programming |
| 117 | Populating Next Right Pointers in Each Node II | Medium | 1628 | linked-listtreedepth-first-search+2 |
| 118 | Pascal's Triangle | Easy | 1168 | arraydynamic-programming |
| 119 | Pascal's Triangle II | Easy | 1178 | arraydynamic-programming |
| 120 | Triangle | Medium | 1533 | arraydynamic-programming |
| 121 | Best Time to Buy and Sell Stock | Easy | 1487 | arraydynamic-programming |
| 122 | Best Time to Buy and Sell Stock II | Medium | 1486 | arraydynamic-programminggreedy |
| 123 | Best Time to Buy and Sell Stock III | Hard | 1977 | arraydynamic-programming |
| 124 | Binary Tree Maximum Path Sum | Hard | 1807 | dynamic-programmingtreedepth-first-search+1 |
| 125 | Valid Palindrome | Easy | 1138 | two-pointersstring |
| 127 | Word Ladder | Hard | 2061 | hash-tablestringbreadth-first-search |
| 128 | Longest Consecutive Sequence | Medium | 1680 | arrayhash-tableunion-find |
| 129 | Sum Root to Leaf Numbers | Medium | 1399 | treedepth-first-searchbinary-tree |
| 130 | Surrounded Regions | Medium | 1706 | arraydepth-first-searchbreadth-first-search+2 |
| 131 | Palindrome Partitioning | Medium | 1615 | stringdynamic-programmingbacktracking |
| 133 | Clone Graph | Medium | 1521 | hash-tabledepth-first-searchbreadth-first-search+1 |
| 134 | Gas Station | Medium | 1767 | arraygreedy |
| 135 | Candy | Hard | 1750 | arraygreedy |
| 136 | Single Number | Easy | 1150 | arraybit-manipulation |
| 137 | Single Number II | Medium | 1710 | arraybit-manipulation |
| 138 | Copy List with Random Pointer | Medium | 1618 | hash-tablelinked-list |
| 139 | Word Break | Medium | 1673 | arrayhash-tablestring+3 |
| 140 | Word Break II | Hard | 2081 | hash-tablestringdynamic-programming+3 |
| 141 | Linked List Cycle | Easy | 1302 | hash-tablelinked-listtwo-pointers |
| 143 | Reorder List | Medium | 1532 | linked-listtwo-pointersstack+1 |
| 144 | Binary Tree Preorder Traversal | Easy | 1258 | stacktreedepth-first-search+1 |
| 145 | Binary Tree Postorder Traversal | Easy | 1214 | stacktreedepth-first-search+1 |
| 146 | LRU Cache | Medium | 1793 | hash-tablelinked-listdesign+1 |
| 148 | Sort List | Medium | 1636 | linked-listtwo-pointersdivide-and-conquer+2 |
| 149 | Max Points on a Line | Hard | 1978 | arrayhash-tablemath+1 |
| 150 | Evaluate Reverse Polish Notation | Medium | 1492 | arraymathstack |
| 151 | Reverse Words in a String | Medium | 1384 | two-pointersstring |
| 152 | Maximum Product Subarray | Medium | 1555 | arraydynamic-programming |
| 153 | Find Minimum in Rotated Sorted Array | Medium | 1485 | arraybinary-search |
| 155 | Min Stack | Medium | 1419 | stackdesign |
| 162 | Find Peak Element | Medium | 1536 | arraybinary-search |
| 167 | Two Sum II - Input Array Is Sorted | Medium | 1389 | arraytwo-pointersbinary-search |
| 169 | Majority Element | Easy | 1235 | arrayhash-tabledivide-and-conquer+2 |
| 172 | Factorial Trailing Zeroes | Medium | 1399 | math |
| 173 | Binary Search Tree Iterator | Medium | 1569 | stacktreedesign+3 |
| 188 | Best Time to Buy and Sell Stock IV | Hard | 2037 | arraydynamic-programming |
| 189 | Rotate Array | Medium | 1433 | arraymathtwo-pointers |
| 190 | Reverse Bits | Easy | 1149 | divide-and-conquerbit-manipulation |
| 191 | Number of 1 Bits | Easy | 1088 | divide-and-conquerbit-manipulation |
| 198 | House Robber | Medium | 1514 | arraydynamic-programming |
| 199 | Binary Tree Right Side View | Medium | 1454 | treedepth-first-searchbreadth-first-search+1 |
| 200 | Number of Islands | Medium | 1580 | arraydepth-first-searchbreadth-first-search+2 |
| 201 | Bitwise AND of Numbers Range | Medium | 1604 | bit-manipulation |
| 202 | Happy Number | Easy | 1188 | hash-tablemathtwo-pointers |
| 203 | Remove Linked List Elements | Easy | 1222 | linked-listrecursion |
| 205 | Isomorphic Strings | Easy | 1262 | hash-tablestring |
| 206 | Reverse Linked List | Easy | 1186 | linked-listrecursion |
| 207 | Course Schedule | Medium | 1656 | depth-first-searchbreadth-first-searchgraph+1 |
| 208 | Implement Trie (Prefix Tree) | Medium | 1543 | hash-tablestringdesign+1 |
| 209 | Minimum Size Subarray Sum | Medium | 1445 | arraybinary-searchsliding-window+1 |
| 210 | Course Schedule II | Medium | 1681 | depth-first-searchbreadth-first-searchgraph+1 |
| 211 | Design Add and Search Words Data Structure | Medium | 1758 | stringdepth-first-searchdesign+1 |
| 212 | Word Search II | Hard | 1976 | arraystringbacktracking+2 |
| 213 | House Robber II | Medium | 1608 | arraydynamic-programming |
| 215 | Kth Largest Element in an Array | Medium | 1508 | arraydivide-and-conquersorting+2 |
| 217 | Contains Duplicate | Easy | 1160 | arrayhash-tablesorting |
| 218 | The Skyline Problem | Hard | 2452 | arraydivide-and-conquerbinary-search+5 |
| 219 | Contains Duplicate II | Easy | 1320 | arrayhash-tablesliding-window |
| 221 | Maximal Square | Medium | 1638 | arraydynamic-programmingmatrix |
| 222 | Count Complete Tree Nodes | Easy | 1375 | binary-searchtreedepth-first-search+1 |
| 224 | Basic Calculator | Hard | 2010 | mathstringstack+1 |
| 226 | Invert Binary Tree | Easy | 1160 | treedepth-first-searchbreadth-first-search+1 |
| 228 | Summary Ranges | Easy | 1192 | array |
| 230 | Kth Smallest Element in a BST | Medium | 1401 | treedepth-first-searchbinary-search-tree+1 |
| 231 | Power of Two | Easy | 1154 | mathbit-manipulationrecursion |
| 232 | Implement Queue using Stacks | Easy | 1356 | stackdesignqueue |
| 234 | Palindrome Linked List | Easy | 1281 | linked-listtwo-pointersstack+1 |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | 1333 | treedepth-first-searchbinary-search-tree+1 |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | 1660 | treedepth-first-searchbinary-tree |
| 238 | Product of Array Except Self | Medium | 1480 | arrayprefix-sum |
| 239 | Sliding Window Maximum | Hard | 1860 | arrayqueuesliding-window+2 |
| 240 | Search a 2D Matrix II | Medium | 1499 | arraybinary-searchdivide-and-conquer+1 |
| 242 | Valid Anagram | Easy | 1151 | hash-tablestringsorting |
| 252 | Meeting Rooms | Easy | 1163 | arraysorting |
| 253 | Meeting Rooms II | Medium | 1582 | arraytwo-pointersgreedy+3 |
| 260 | Single Number III | Medium | 1321 | arraybit-manipulation |
| 261 | Graph Valid Tree | Medium | 1620 | depth-first-searchbreadth-first-searchunion-find+1 |
| 268 | Missing Number | Easy | 1114 | arrayhash-tablemath+2 |
| 269 | Alien Dictionary | Hard | 1930 | arraystringdepth-first-search+3 |
| 271 | Encode and Decode Strings | Medium | 1530 | arraystringdesign |
| 274 | H-Index | Medium | 1405 | arraysortingcounting-sort |
| 278 | First Bad Version | Easy | 1161 | binary-searchinteractive |
| 279 | Perfect Squares | Medium | 1529 | mathdynamic-programmingbreadth-first-search |
| 286 | Walls and Gates | Medium | 1638 | arraybreadth-first-searchmatrix |
| 287 | Find the Duplicate Number | Medium | 1689 | arraytwo-pointersbinary-search+1 |
| 289 | Game of Life | Medium | 1529 | arraymatrixsimulation |
| 290 | Word Pattern | Easy | 1294 | hash-tablestring |
| 295 | Find Median from Data Stream | Hard | 1973 | two-pointersdesignsorting+2 |
| 297 | Serialize and Deserialize Binary Tree | Hard | 1884 | stringtreedepth-first-search+3 |
| 300 | Longest Increasing Subsequence | Medium | 1666 | arraybinary-searchdynamic-programming |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | 1708 | arraydynamic-programming |
| 312 | Burst Balloons | Hard | 2056 | arraydynamic-programming |
| 315 | Count of Smaller Numbers After Self | Hard | 2215 | arraybinary-searchdivide-and-conquer+4 |
| 316 | Remove Duplicate Letters | Medium | 1568 | stringgreedystack+1 |
| 322 | Coin Change | Medium | 1684 | arraydynamic-programmingbreadth-first-search |
| 323 | Number of Connected Components in an Undirected Graph | Medium | 1558 | depth-first-searchbreadth-first-searchunion-find+1 |
| 329 | Longest Increasing Path in a Matrix | Hard | 1965 | arraydynamic-programmingdepth-first-search+5 |
| 330 | Patching Array | Hard | 2073 | arraygreedy |
| 332 | Reconstruct Itinerary | Hard | 1858 | depth-first-searchgrapheulerian-circuit |
| 336 | Palindrome Pairs | Hard | 2311 | arrayhash-tablestring+1 |
| 338 | Counting Bits | Easy | 1203 | dynamic-programmingbit-manipulation |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | 1679 | hash-tablestringsliding-window |
| 347 | Top K Frequent Elements | Medium | 1540 | arrayhash-tabledivide-and-conquer+5 |
| 352 | Data Stream as Disjoint Intervals | Hard | 1700 | binary-searchdesignordered-set |
| 355 | Design Twitter | Medium | 1479 | hash-tablelinked-listdesign+1 |
| 371 | Sum of Two Integers | Medium | 1564 | mathbit-manipulation |
| 373 | Find K Pairs with Smallest Sums | Medium | 1710 | arrayheap-priority-queue |
| 374 | Guess Number Higher or Lower | Easy | 1100 | binary-searchinteractive |
| 377 | Combination Sum IV | Medium | 1609 | arraydynamic-programming |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | 1457 | arraybinary-searchsorting+2 |
| 380 | Insert Delete GetRandom O(1) | Medium | 1571 | arrayhash-tablemath+2 |
| 383 | Ransom Note | Easy | 1139 | hash-tablestringcounting |
| 389 | Find the Difference | Easy | 1215 | hash-tablestringbit-manipulation+1 |
| 392 | Is Subsequence | Easy | 1282 | two-pointersstringdynamic-programming |
| 399 | Evaluate Division | Medium | 1747 | arraystringdepth-first-search+4 |
| 402 | Remove K Digits | Medium | 1792 | stringgreedystack+1 |
| 406 | Queue Reconstruction by Height | Medium | 1506 | arraygreedysorting |
| 407 | Trapping Rain Water II | Hard | 2200 | arraybreadth-first-searchheap-priority-queue+1 |
| 408 | Valid Word Abbreviation | Easy | 1239 | two-pointersstring |
| 409 | Longest Palindrome | Easy | 1132 | hash-tablestringgreedy |
| 410 | Split Array Largest Sum | Hard | 1856 | arraybinary-searchdynamic-programming+2 |
| 416 | Partition Equal Subset Sum | Medium | 1624 | arraydynamic-programming |
| 417 | Pacific Atlantic Water Flow | Medium | 1707 | arraydepth-first-searchbreadth-first-search+1 |
| 421 | Maximum XOR of Two Numbers in an Array | Medium | 1712 | arrayhash-tablebit-manipulation+1 |
| 424 | Longest Repeating Character Replacement | Medium | 1680 | hash-tablestringsliding-window |
| 427 | Construct Quad Tree | Medium | 1464 | arraydivide-and-conquertree+1 |
| 433 | Minimum Genetic Mutation | Medium | 1671 | hash-tablestringbreadth-first-search |
| 435 | Non-overlapping Intervals | Medium | 1567 | arraydynamic-programminggreedy+1 |
| 436 | Find Right Interval | Medium | 1416 | arraybinary-searchsorting |
| 438 | Find All Anagrams in a String | Medium | 1483 | hash-tablestringsliding-window |
| 450 | Delete Node in a BST | Medium | 1590 | treebinary-search-treebinary-tree |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | 1703 | arraygreedysorting |
| 455 | Assign Cookies | Easy | 1148 | arraygreedysorting+1 |
| 461 | Hamming Distance | Easy | 1085 | bit-manipulation |
| 472 | Concatenated Words | Hard | 1945 | arraystringdynamic-programming+2 |
| 477 | Total Hamming Distance | Medium | 1489 | arraymathbit-manipulation |
| 494 | Target Sum | Medium | 1679 | arraydynamic-programmingbacktracking |
| 495 | Teemo Attacking | Easy | 1323 | arraysimulation |
| 496 | Next Greater Element I | Easy | 1318 | arrayhash-tablestack+1 |
| 502 | IPO | Hard | 2099 | arraygreedysorting+1 |
| 503 | Next Greater Element II | Medium | 1513 | arraystackmonotonic-stack |
| 518 | Coin Change II | Medium | 1697 | arraydynamic-programming |
| 530 | Minimum Absolute Difference in BST | Easy | 1207 | treedepth-first-searchbreadth-first-search+2 |
| 542 | 01 Matrix | Medium | 1538 | arraydynamic-programmingbreadth-first-search+1 |
| 543 | Diameter of Binary Tree | Easy | 1287 | treedepth-first-searchbinary-tree |
| 554 | Brick Wall | Medium | 1483 | arrayhash-table |
| 560 | Subarray Sum Equals K | Medium | 1621 | arrayhash-tableprefix-sum |
| 567 | Permutation in String | Medium | 1584 | hash-tabletwo-pointersstring+1 |
| 572 | Subtree of Another Tree | Easy | 1377 | treedepth-first-searchstring-matching+2 |
| 588 | Design In-Memory File System | Hard | 1894 | hash-tablestringdesign+1 |
| 621 | Task Scheduler | Medium | 1667 | arrayhash-tablegreedy+3 |
| 632 | Smallest Range Covering Elements from K Lists | Hard | 2093 | arrayhash-tablegreedy+3 |
| 637 | Average of Levels in Binary Tree | Easy | 1186 | treedepth-first-searchbreadth-first-search+1 |
| 643 | Maximum Average Subarray I | Easy | 1226 | arraysliding-window |
| 646 | Maximum Length of Pair Chain | Medium | 1544 | arraydynamic-programminggreedy+1 |
| 647 | Palindromic Substrings | Medium | 1525 | two-pointersstringdynamic-programming |
| 658 | Find K Closest Elements | Medium | 1702 | arraytwo-pointersbinary-search+2 |
| 676 | Implement Magic Dictionary | Medium | 1480 | hash-tablestringdepth-first-search+1 |
| 678 | Valid Parenthesis String | Medium | 1700 | stringdynamic-programmingstack+1 |
| 680 | Valid Palindrome II | Easy | 1290 | two-pointersstringgreedy |
| 684 | Redundant Connection | Medium | 1597 | depth-first-searchbreadth-first-searchunion-find+1 |
| 693 | Binary Number with Alternating Bits | Easy | 1074 | bit-manipulation |
| 695 | Max Area of Island | Medium | 1470 | arraydepth-first-searchbreadth-first-search+2 |
| 703 | Kth Largest Element in a Stream | Easy | 1360 | treedesignbinary-search-tree+3 |
| 704 | Binary Search | Easy | 1162 | arraybinary-search |
| 713 | Subarray Product Less Than K | Medium | 1539 | arraysliding-windowprefix-sum |
| 719 | Find K-th Smallest Pair Distance | Hard | 1983 | arraytwo-pointersbinary-search+1 |
| 721 | Accounts Merge | Medium | 1664 | arrayhash-tablestring+4 |
| 733 | Flood Fill | Easy | 1139 | arraydepth-first-searchbreadth-first-search+1 |
| 739 | Daily Temperatures | Medium | 1418 | arraystackmonotonic-stack |
| 743 | Network Delay Time | Medium | 1648 | depth-first-searchbreadth-first-searchgraph+2 |
| 745 | Prefix and Suffix Search | Hard | 2002 | hash-tablestringdesign+1 |
| 746 | Min Cost Climbing Stairs | Easy | 1167 | arraydynamic-programming |
| 759 | Employee Free Time | Hard | 1712 | arraysortingheap-priority-queue |
| 762 | Prime Number of Set Bits in Binary Representations | Easy | 1262 | mathbit-manipulation |
| 763 | Partition Labels | Medium | 1464 | hash-tabletwo-pointersstring+1 |
| 778 | Swim in Rising Water | Hard | 2097 | arraybinary-searchdepth-first-search+4 |
| 786 | K-th Smallest Prime Fraction | Medium | 1818 | arraytwo-pointersbinary-search+2 |
| 787 | Cheapest Flights Within K Stops | Medium | 1786 | dynamic-programmingdepth-first-searchbreadth-first-search+3 |
| 820 | Short Encoding of Words | Medium | 1623 | arrayhash-tablestring+1 |
| 843 | Guess the Word | Hard | 1985 | arraymathstring+2 |
| 846 | Hand of Straights | Medium | 1604 | arrayhash-tablegreedy+1 |
| 852 | Peak Index in a Mountain Array | Medium | 1176 | arraybinary-search |
| 853 | Car Fleet | Medium | 1740 | arraymathstack+2 |
| 860 | Lemonade Change | Easy | 1186 | arraygreedy |
| 875 | Koko Eating Bananas | Medium | 1765 | arraybinary-search |
| 876 | Middle of the Linked List | Easy | 1168 | linked-listtwo-pointers |
| 901 | Online Stock Span | Medium | 1708 | stackdesignmonotonic-stack+1 |
| 904 | Fruit Into Baskets | Medium | 1709 | arrayhash-tablesliding-window |
| 907 | Sum of Subarray Minimums | Medium | 1823 | arraydynamic-programmingstack+1 |
| 909 | Snakes and Ladders | Medium | 1962 | arraybreadth-first-searchmatrix |
| 918 | Maximum Sum Circular Subarray | Medium | 1777 | arraydivide-and-conquerdynamic-programming+2 |
| 921 | Minimum Add to Make Parentheses Valid | Medium | 1248 | stringstackgreedy |
| 973 | K Closest Points to Origin | Medium | 1470 | arraymathdivide-and-conquer+4 |
| 981 | Time Based Key-Value Store | Medium | 1676 | hash-tablestringbinary-search+1 |
| 986 | Interval List Intersections | Medium | 1579 | arraytwo-pointers |
| 994 | Rotting Oranges | Medium | 1571 | arraybreadth-first-searchmatrix |
| 1004 | Max Consecutive Ones III | Medium | 1655 | arraybinary-searchsliding-window+1 |
| 1011 | Capacity To Ship Packages Within D Days | Medium | 1725 | arraybinary-search |
| 1019 | Next Greater Node In Linked List | Medium | 1546 | arraylinked-liststack+1 |
| 1029 | Two City Scheduling | Medium | 1441 | arraygreedysorting |
| 1032 | Stream of Characters | Hard | 1891 | arraystringdesign+2 |
| 1046 | Last Stone Weight | Easy | 1172 | arrayheap-priority-queue |
| 1091 | Shortest Path in Binary Matrix | Medium | 1655 | arraybreadth-first-searchmatrix |
| 1143 | Longest Common Subsequence | Medium | 1727 | stringdynamic-programming |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | 1541 | arraybinary-search |
| 1288 | Remove Covered Intervals | Medium | 1375 | arraygreedysorting |
| 1343 | Number of Sub-arrays of Size K and Average Greater Than or Equal to Threshold | Medium | 1317 | arraysliding-window |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | 1786 | arraygreedysorting+1 |
| 1448 | Count Good Nodes in Binary Tree | Medium | 1438 | treedepth-first-searchbreadth-first-search+1 |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | 1263 | stringsliding-window |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | 1225 | arraystackmonotonic-stack |
| 1584 | Min Cost to Connect All Points | Medium | 1605 | arrayunion-findgraph+1 |
| 1675 | Minimize Deviation in Array | Hard | 2091 | arraygreedyheap-priority-queue+1 |
| 1695 | Maximum Erasure Value | Medium | 1528 | arrayhash-tablesliding-window |
| 1851 | Minimum Interval to Include Each Query | Hard | 2286 | arraybinary-searchsorting+1 |
| 1899 | Merge Triplets to Form Target Triplet | Medium | 1635 | arraygreedy |
| 1944 | Number of Visible People in a Queue | Hard | 2105 | arraystackmonotonic-stack |
| 2013 | Detect Squares | Medium | 1678 | arrayhash-tabledesign+1 |
| 2090 | K Radius Subarray Averages | Medium | 1358 | arraysliding-window |
| 2104 | Sum of Subarray Ranges | Medium | 1504 | arraystackmonotonic-stack |
| 2260 | Minimum Consecutive Cards to Pick Up | Medium | 1415 | arrayhash-tablesliding-window |
| 2300 | Successful Pairs of Spells and Potions | Medium | 1476 | arraytwo-pointersbinary-search+1 |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | 1553 | arrayhash-tablesliding-window |
| 2516 | Take K of Each Character From Left and Right | Medium | 1660 | hash-tablestringsliding-window |
| 2866 | Beautiful Towers II | Medium | 1974 | arraystackmonotonic-stack |