| 0001 | Two Sum | Go | Easy | O(n) | O(n) | | 49.7% |
| 0003 | Longest Substring Without Repeating Characters | Go | Medium | O(n) | O(1) | ❤️ | 33.8% |
| 0012 | Integer to Roman | Go | Medium | | | | 62.0% |
| 0013 | Roman to Integer | Go | Easy | | | | 58.6% |
| 0017 | Letter Combinations of a Phone Number | Go | Medium | | | | 56.6% |
| 0030 | Substring with Concatenation of All Words | Go | Hard | O(n) | O(n) | ❤️ | 31.2% |
| 0036 | Valid Sudoku | Go | Medium | O(n^2) | O(n^2) | | 58.1% |
| 0037 | Sudoku Solver | Go | Hard | O(n^2) | O(n^2) | ❤️ | 57.7% |
| 0041 | First Missing Positive | Go | Hard | | | | 36.7% |
| 0049 | Group Anagrams | Go | Medium | O(n log n) | O(n) | | 66.8% |
| 0073 | Set Matrix Zeroes | Go | Medium | | | | 51.3% |
| 0076 | Minimum Window Substring | Go | Hard | O(n) | O(n) | ❤️ | 40.9% |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | Go | Medium | | | | 61.6% |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | Go | Medium | | | | 60.0% |
| 0126 | Word Ladder II | Go | Hard | | | | 27.5% |
| 0127 | Word Ladder | Go | Hard | | | | 37.2% |
| 0128 | Longest Consecutive Sequence | Go | Medium | | | | 48.5% |
| 0138 | Copy List with Random Pointer | Go | Medium | O(n) | O(1) | | 51.4% |
| 0141 | Linked List Cycle | Go | Easy | | | | 47.5% |
| 0142 | Linked List Cycle II | Go | Medium | | | | 48.8% |
| 0146 | LRU Cache | Go | Medium | | | | 40.7% |
| 0160 | Intersection of Two Linked Lists | Go | Easy | | | | 54.4% |
| 0169 | Majority Element | Go | Easy | | | | 63.9% |
| 0187 | Repeated DNA Sequences | Go | Medium | | | | 47.0% |
| 0202 | Happy Number | Go | Easy | O(log n) | O(1) | | 54.8% |
| 0205 | Isomorphic Strings | Go | Easy | O(log n) | O(n) | | 42.9% |
| 0208 | Implement Trie (Prefix Tree) | Go | Medium | | | | 62.8% |
| 0217 | Contains Duplicate | Go | Easy | O(n) | O(n) | | 61.4% |
| 0219 | Contains Duplicate II | Go | Easy | O(n) | O(n) | | 42.6% |
| 0229 | Majority Element II | Go | Medium | | | | 45.1% |
| 0242 | Valid Anagram | Go | Easy | O(n) | O(n) | | 63.1% |
| 0264 | Ugly Number II | Go | Medium | | | | 46.2% |
| 0268 | Missing Number | Go | Easy | | | | 62.6% |
| 0290 | Word Pattern | Go | Easy | O(n) | O(n) | | 41.7% |
| 0299 | Bulls and Cows | Go | Medium | | | | 49.4% |
| 0347 | Top K Frequent Elements | Go | Medium | O(n) | O(n) | | 64.2% |
| 0349 | Intersection of Two Arrays | Go | Easy | O(n) | O(n) | | 70.9% |
| 0350 | Intersection of Two Arrays II | Go | Easy | O(n) | O(n) | | 56.0% |
| 0383 | Ransom Note | Go | Easy | | | | 58.3% |
| 0387 | First Unique Character in a String | Go | Easy | | | | 59.6% |
| 0389 | Find the Difference | Go | Easy | | | | 59.9% |
| 0395 | Longest Substring with At Least K Repeating Characters | Go | Medium | | | | 44.8% |
| 0409 | Longest Palindrome | Go | Easy | | | | 54.2% |
| 0421 | Maximum XOR of Two Numbers in an Array | Go | Medium | | | | 54.0% |
| 0423 | Reconstruct Original Digits from English | Go | Medium | | | | 51.2% |
| 0424 | Longest Repeating Character Replacement | Go | Medium | | | | 52.0% |
| 0433 | Minimum Genetic Mutation | Go | Medium | | | | 52.4% |
| 0438 | Find All Anagrams in a String | Go | Medium | O(n) | O(1) | | 50.2% |
| 0447 | Number of Boomerangs | Go | Medium | O(n) | O(1) | | 54.9% |
| 0448 | Find All Numbers Disappeared in an Array | Go | Easy | | | | 59.9% |
| 0451 | Sort Characters By Frequency | Go | Medium | O(n log n) | O(1) | | 70.1% |
| 0454 | 4Sum II | Go | Medium | O(n^2) | O(n) | | 57.2% |
| 0457 | Circular Array Loop | Go | Medium | | | | 32.6% |
| 0460 | LFU Cache | Go | Hard | | | | 43.0% |
| 0480 | Sliding Window Median | Go | Hard | | | | 41.1% |
| 0491 | Non-decreasing Subsequences | Go | Medium | | | | 60.2% |
| 0496 | Next Greater Element I | Go | Easy | | | | 71.4% |
| 0500 | Keyboard Row | Go | Easy | | | | 69.6% |
| 0508 | Most Frequent Subtree Sum | Go | Medium | | | | 64.9% |
| 0519 | Random Flip Matrix | Go | Medium | | | | 40.0% |
| 0523 | Continuous Subarray Sum | Go | Medium | | | | 28.5% |
| 0525 | Contiguous Array | Go | Medium | | | | 46.8% |
| 0532 | K-diff Pairs in an Array | Go | Medium | | | | 41.2% |
| 0535 | Encode and Decode TinyURL | Go | Medium | | | | 86.0% |
| 0554 | Brick Wall | Go | Medium | | | | 53.6% |
| 0560 | Subarray Sum Equals K | Go | Medium | | | | 43.7% |
| 0567 | Permutation in String | Go | Medium | | | | 44.3% |
| 0575 | Distribute Candies | Go | Easy | | | | 66.5% |
| 0594 | Longest Harmonious Subsequence | Go | Easy | | | | 53.5% |
| 0599 | Minimum Index Sum of Two Lists | Go | Easy | | | | 53.4% |
| 0609 | Find Duplicate File in System | Go | Medium | | | | 67.7% |
| 0632 | Smallest Range Covering Elements from K Lists | Go | Hard | | | | 61.0% |
| 0645 | Set Mismatch | Go | Easy | | | | 42.7% |
| 0648 | Replace Words | Go | Medium | O(n) | O(n) | | 62.7% |
| 0653 | Two Sum IV - Input is a BST | Go | Easy | | | | 61.0% |
| 0676 | Implement Magic Dictionary | Go | Medium | O(n) | O(n) | | 56.9% |
| 0677 | Map Sum Pairs | Go | Medium | | | | 56.8% |
| 0690 | Employee Importance | Go | Medium | | | | 65.6% |
| 0692 | Top K Frequent Words | Go | Medium | | | | 57.2% |
| 0697 | Degree of an Array | Go | Easy | | | | 56.0% |
| 0705 | Design HashSet | Go | Easy | | | | 65.6% |
| 0706 | Design HashMap | Go | Easy | | | | 64.7% |
| 0710 | Random Pick with Blacklist | Go | Hard | O(n) | O(n) | | 33.5% |
| 0720 | Longest Word in Dictionary | Go | Medium | O(n) | O(n) | | 52.0% |
| 0726 | Number of Atoms | Go | Hard | O(n) | O(n) | ❤️ | 52.2% |
| 0745 | Prefix and Suffix Search | Go | Hard | | | | 41.2% |
| 0748 | Shortest Completing Word | Go | Easy | | | | 59.3% |
| 0752 | Open the Lock | Go | Medium | | | | 55.6% |
| 0763 | Partition Labels | Go | Medium | | | | 79.7% |
| 0767 | Reorganize String | Go | Medium | | | | 52.9% |
| 0771 | Jewels and Stones | Go | Easy | | | | 88.2% |
| 0781 | Rabbits in Forest | Go | Medium | | | | 54.7% |
| 0791 | Custom Sort String | Go | Medium | | | | 69.1% |
| 0792 | Number of Matching Subsequences | Go | Medium | | | | 51.6% |
| 0811 | Subdomain Visit Count | Go | Medium | | | | 75.5% |
| 0815 | Bus Routes | Go | Hard | | | | 45.6% |
| 0817 | Linked List Components | Go | Medium | | | | 57.7% |
| 0819 | Most Common Word | Go | Easy | | | | 44.7% |
| 0820 | Short Encoding of Words | Go | Medium | | | | 60.6% |
| 0823 | Binary Trees With Factors | Go | Medium | | | | 49.7% |
| 0828 | Count Unique Characters of All Substrings of a Given String | Go | Hard | | | | 51.6% |
| 0846 | Hand of Straights | Go | Medium | | | | 56.2% |
| 0859 | Buddy Strings | Go | Easy | | | | 29.2% |
| 0884 | Uncommon Words from Two Sentences | Go | Easy | | | | 66.4% |
| 0888 | Fair Candy Swap | Go | Easy | | | | 60.7% |
| 0890 | Find and Replace Pattern | Go | Medium | | | | 77.6% |
| 0895 | Maximum Frequency Stack | Go | Hard | O(n) | O(n) | | 66.6% |
| 0904 | Fruit Into Baskets | Go | Medium | | | | 43.7% |
| 0911 | Online Election | Go | Medium | | | | 52.2% |
| 0914 | X of a Kind in a Deck of Cards | Go | Easy | | | | 31.2% |
| 0916 | Word Subsets | Go | Medium | | | | 53.7% |
| 0923 | 3Sum With Multiplicity | Go | Medium | | | | 45.3% |
| 0930 | Binary Subarrays With Sum | Go | Medium | O(n) | O(n) | ❤️ | 52.2% |
| 0953 | Verifying an Alien Dictionary | Go | Easy | | | | 54.5% |
| 0961 | N-Repeated Element in Size 2N Array | Go | Easy | | | | 76.1% |
| 0966 | Vowel Spellchecker | Go | Medium | | | | 51.4% |
| 0970 | Powerful Integers | Go | Medium | | | | 43.6% |
| 0981 | Time Based Key-Value Store | Go | Medium | | | | 52.2% |
| 0987 | Vertical Order Traversal of a Binary Tree | Go | Hard | | | | 45.1% |
| 0992 | Subarrays with K Different Integers | Go | Hard | O(n) | O(n) | ❤️ | 54.6% |
| 0997 | Find the Town Judge | Go | Easy | | | | 49.5% |
| 1002 | Find Common Characters | Go | Easy | | | | 68.5% |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Go | Medium | | | | 52.8% |
| 1048 | Longest String Chain | Go | Medium | | | | 59.3% |
| 1054 | Distant Barcodes | Go | Medium | | | | 45.9% |
| 1074 | Number of Submatrices That Sum to Target | Go | Hard | | | | 69.5% |
| 1079 | Letter Tile Possibilities | Go | Medium | | | | 76.0% |
| 1122 | Relative Sort Array | Go | Easy | | | | 68.6% |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Go | Medium | | | | 70.9% |
| 1128 | Number of Equivalent Domino Pairs | Go | Easy | | | | 47.1% |
| 1160 | Find Words That Can Be Formed by Characters | Go | Easy | | | | 67.5% |
| 1170 | Compare Strings by Frequency of the Smallest Character | Go | Medium | | | | 61.5% |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Go | Medium | | | | 43.2% |
| 1178 | Number of Valid Words for Each Puzzle | Go | Hard | | | | 46.3% |
| 1189 | Maximum Number of Balloons | Go | Easy | | | | 61.0% |
| 1202 | Smallest String With Swaps | Go | Medium | | | | 57.7% |
| 1207 | Unique Number of Occurrences | Go | Easy | | | | 73.5% |
| 1275 | Find Winner on a Tic Tac Toe Game | Go | Easy | | | | 54.2% |
| 1296 | Divide Array in Sets of K Consecutive Numbers | Go | Medium | | | | 56.5% |
| 1396 | Design Underground System | Go | Medium | | | | 73.6% |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | Go | Medium | | | | 76.1% |
| 1461 | Check If a String Contains All Binary Codes of Size K | Go | Medium | | | | 56.6% |
| 1512 | Number of Good Pairs | Go | Easy | | | | 88.2% |
| 1600 | Throne Inheritance | Go | Medium | | | | 63.6% |
| 1624 | Largest Substring Between Two Equal Characters | Go | Easy | | | | 59.1% |
| 1636 | Sort Array by Increasing Frequency | Go | Easy | | | | 69.5% |
| 1640 | Check Array Formation Through Concatenation | Go | Easy | | | | 56.2% |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Go | Medium | | | | 59.1% |
| 1656 | Design an Ordered Stream | Go | Easy | | | | 85.2% |
| 1657 | Determine if Two Strings Are Close | Go | Medium | | | | 56.3% |
| 1658 | Minimum Operations to Reduce X to Zero | Go | Medium | | | | 37.6% |
| 1674 | Minimum Moves to Make Array Complementary | Go | Medium | | | | 38.7% |
| 1679 | Max Number of K-Sum Pairs | Go | Medium | | | | 57.3% |
| 1684 | Count the Number of Consistent Strings | Go | Easy | | | | 82.3% |
| 1695 | Maximum Erasure Value | Go | Medium | | | | 57.6% |
| 1742 | Maximum Number of Balls in a Box | Go | Easy | | | | 73.6% |
| 1748 | Sum of Unique Elements | Go | Easy | | | | 76.3% |
| 1763 | Longest Nice Substring | Go | Easy | | | | 61.5% |
| 2043 | Simple Bank System | Go | Medium | | | | 65.2% |
| 2166 | Design Bitset | Go | Medium | | | | 31.8% |
| 2170 | Minimum Operations to Make the Array Alternating | Go | Medium | | | | 33.2% |
| ———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |