| 0003 | Longest Substring Without Repeating Characters | Hash Table, String, Sliding Window |
| 0012 | Integer to Roman | Hash Table, Math, String |
| 0017 | Letter Combinations of a Phone Number | Hash Table, String, Backtracking |
| 0036 | Valid Sudoku | Array, Hash Table, Matrix |
| 0049 | Group Anagrams | Array, Hash Table, String +1 |
| 0073 | Set Matrix Zeroes | Array, Hash Table, Matrix |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | Tree, Array, Hash Table +2 |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | Tree, Array, Hash Table +2 |
| 0128 | Longest Consecutive Sequence | Union Find, Array, Hash Table |
| 0133 | Clone Graph | Depth-First Search, Breadth-First Search, Graph +1 |
| 0138 | Copy List with Random Pointer | Hash Table, Linked List |
| 0139 | Word Break | Trie, Memoization, Array +3 |
| 0142 | Linked List Cycle II | Hash Table, Linked List, Two Pointers |
| 0146 | LRU Cache | Design, Hash Table, Linked List +1 |
| 0166 | Fraction to Recurring Decimal | Hash Table, Math, String |
| 0187 | Repeated DNA Sequences | Bit Manipulation, Hash Table, String +3 |
| 0208 | Implement Trie (Prefix Tree) | Design, Trie, Hash Table +1 |
| 0229 | Majority Element II | Array, Hash Table, Counting +1 |
| 0264 | Ugly Number II | Hash Table, Math, Dynamic Programming +1 |
| 0299 | Bulls and Cows | Hash Table, String, Counting |
| 0347 | Top K Frequent Elements | Array, Hash Table, Divide and Conquer +5 |
| 0355 | Design Twitter | Design, Hash Table, Linked List +1 |
| 0380 | Insert Delete GetRandom O(1) | Design, Array, Hash Table +2 |
| 0395 | Longest Substring with At Least K Repeating Characters | Hash Table, String, Divide and Conquer +1 |
| 0398 | Random Pick Index | Reservoir Sampling, Hash Table, Math +1 |
| 0421 | Maximum XOR of Two Numbers in an Array | Bit Manipulation, Trie, Array +1 |
| 0423 | Reconstruct Original Digits from English | Hash Table, Math, String |
| 0424 | Longest Repeating Character Replacement | Hash Table, String, Sliding Window |
| 0433 | Minimum Genetic Mutation | Breadth-First Search, Hash Table, String |
| 0438 | Find All Anagrams in a String | Hash Table, String, Sliding Window |
| 0442 | Find All Duplicates in an Array | Array, Hash Table, Sorting |
| 0447 | Number of Boomerangs | Array, Hash Table, Math |
| 0451 | Sort Characters By Frequency | Hash Table, String, Bucket Sort +3 |
| 0454 | 4Sum II | Array, Hash Table |
| 0457 | Circular Array Loop | Array, Hash Table, Two Pointers |
| 0491 | Non-decreasing Subsequences | Bit Manipulation, Array, Hash Table +1 |
| 0508 | Most Frequent Subtree Sum | Tree, Depth-First Search, Hash Table +1 |
| 0519 | Random Flip Matrix | Reservoir Sampling, Hash Table, Math +1 |
| 0522 | Longest Uncommon Subsequence II | Array, Hash Table, Two Pointers +2 |
| 0523 | Continuous Subarray Sum | Array, Hash Table, Math +1 |
| 0525 | Contiguous Array | Array, Hash Table, Prefix Sum |
| 0532 | K-diff Pairs in an Array | Array, Hash Table, Two Pointers +2 |
| 0535 | Encode and Decode TinyURL | Design, Hash Table, String +1 |
| 0554 | Brick Wall | Array, Hash Table |
| 0560 | Subarray Sum Equals K | Array, Hash Table, Prefix Sum |
| 0567 | Permutation in String | Hash Table, Two Pointers, String +1 |
| 0609 | Find Duplicate File in System | Array, Hash Table, String |
| 0621 | Task Scheduler | Greedy, Array, Hash Table +3 |
| 0648 | Replace Words | Trie, Array, Hash Table +1 |
| 0652 | Find Duplicate Subtrees | Tree, Depth-First Search, Hash Table +1 |
| 0659 | Split Array into Consecutive Subsequences | Greedy, Array, Hash Table +1 |
| 0676 | Implement Magic Dictionary | Depth-First Search, Design, Trie +2 |
| 0677 | Map Sum Pairs | Design, Trie, Hash Table +1 |
| 0690 | Employee Importance | Tree, Depth-First Search, Breadth-First Search +2 |
| 0692 | Top K Frequent Words | Trie, Array, Hash Table +5 |
| 0720 | Longest Word in Dictionary | Trie, Array, Hash Table +2 |
| 0721 | Accounts Merge | Depth-First Search, Breadth-First Search, Union Find +4 |
| 0740 | Delete and Earn | Array, Hash Table, Dynamic Programming |
| 0752 | Open the Lock | Breadth-First Search, Array, Hash Table +1 |
| 0756 | Pyramid Transition Matrix | Bit Manipulation, Hash Table, String +1 |
| 0763 | Partition Labels | Greedy, Hash Table, Two Pointers +1 |
| 0767 | Reorganize String | Greedy, Hash Table, String +3 |
| 0781 | Rabbits in Forest | Greedy, Array, Hash Table +1 |
| 0791 | Custom Sort String | Hash Table, String, Sorting |
| 0792 | Number of Matching Subsequences | Trie, Array, Hash Table +4 |
| 0811 | Subdomain Visit Count | Array, Hash Table, String +1 |
| 0817 | Linked List Components | Array, Hash Table, Linked List |
| 0820 | Short Encoding of Words | Trie, Array, Hash Table +1 |
| 0822 | Card Flipping Game | Array, Hash Table |
| 0823 | Binary Trees With Factors | Array, Hash Table, Dynamic Programming +1 |
| 0833 | Find And Replace in String | Array, Hash Table, String +1 |
| 0840 | Magic Squares In Grid | Array, Hash Table, Math +1 |
| 0846 | Hand of Straights | Greedy, Array, Hash Table +1 |
| 0863 | All Nodes Distance K in Binary Tree | Tree, Depth-First Search, Breadth-First Search +2 |
| 0865 | Smallest Subtree with all the Deepest Nodes | Tree, Depth-First Search, Breadth-First Search +2 |
| 0869 | Reordered Power of 2 | Hash Table, Math, Counting +2 |
| 0873 | Length of Longest Fibonacci Subsequence | Array, Hash Table, Dynamic Programming |
| 0874 | Walking Robot Simulation | Array, Hash Table, Simulation |
| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | Tree, Array, Hash Table +2 |
| 0890 | Find and Replace Pattern | Array, Hash Table, String |
| 0893 | Groups of Special-Equivalent Strings | Array, Hash Table, String +1 |
| 0904 | Fruit Into Baskets | Array, Hash Table, Sliding Window |
| 0911 | Online Election | Design, Array, Hash Table +1 |
| 0916 | Word Subsets | Array, Hash Table, String |
| 0923 | 3Sum With Multiplicity | Array, Hash Table, Two Pointers +2 |
| 0930 | Binary Subarrays With Sum | Array, Hash Table, Prefix Sum +1 |
| 0939 | Minimum Area Rectangle | Geometry, Array, Hash Table +2 |
| 0947 | Most Stones Removed with Same Row or Column | Depth-First Search, Union Find, Graph +1 |
| 0954 | Array of Doubled Pairs | Greedy, Array, Hash Table +1 |
| 0959 | Regions Cut By Slashes | Depth-First Search, Breadth-First Search, Union Find +3 |
| 0963 | Minimum Area Rectangle II | Geometry, Array, Hash Table +1 |
| 0966 | Vowel Spellchecker | Array, Hash Table, String |
| 0970 | Powerful Integers | Hash Table, Math, Enumeration |
| 0974 | Subarray Sums Divisible by K | Array, Hash Table, Prefix Sum |
| 0981 | Time Based Key-Value Store | Design, Hash Table, String +1 |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Array, Hash Table, Counting |
| 1015 | Smallest Integer Divisible by K | Hash Table, Math |
| 1016 | Binary String With Substrings Representing 1 To N | Bit Manipulation, Hash Table, String +1 |
| 1027 | Longest Arithmetic Subsequence | Array, Hash Table, Binary Search +1 |
| 1048 | Longest String Chain | Array, Hash Table, Two Pointers +3 |
| 1054 | Distant Barcodes | Greedy, Array, Hash Table +3 |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Array, Hash Table, Matrix |
| 1079 | Letter Tile Possibilities | Hash Table, String, Backtracking +1 |
| 1090 | Largest Values From Labels | Greedy, Array, Hash Table +2 |
| 1110 | Delete Nodes And Return Forest | Tree, Depth-First Search, Array +2 |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Tree, Depth-First Search, Breadth-First Search +2 |
| 1124 | Longest Well-Performing Interval | Stack, Array, Hash Table +2 |
| 1138 | Alphabet Board Path | Hash Table, String |
| 1146 | Snapshot Array | Design, Array, Hash Table +1 |
| 1156 | Swap For Longest Repeated Character Substring | Hash Table, String, Sliding Window |
| 1169 | Invalid Transactions | Array, Hash Table, String +1 |
| 1170 | Compare Strings by Frequency of the Smallest Character | Array, Hash Table, String +2 |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Hash Table, Linked List |
| 1177 | Can Make Palindrome from Substring | Bit Manipulation, Array, Hash Table +2 |
| 1202 | Smallest String With Swaps | Depth-First Search, Breadth-First Search, Union Find +4 |