mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
19 KiB
19 KiB
| title | type | weight |
|---|---|---|
| 2.13 Hash Table | docs | 13 |
Hash Table
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite | Acceptance |
|---|---|---|---|---|---|---|---|
| 0001 | Two Sum | [Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}}) | Easy | O(n) | O(n) | 47.8% | |
| 0003 | Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}}) | Medium | O(n) | O(1) | ❤️ | 32.4% |
| 0012 | Integer to Roman | [Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}}) | Medium | 58.4% | |||
| 0013 | Roman to Integer | [Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}}) | Easy | 57.7% | |||
| 0017 | Letter Combinations of a Phone Number | [Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}}) | Medium | 52.0% | |||
| 0030 | Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}}) | Hard | O(n) | O(n) | ❤️ | 27.4% |
| 0036 | Valid Sudoku | [Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}}) | Medium | O(n^2) | O(n^2) | 53.5% | |
| 0041 | First Missing Positive | [Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}}) | Hard | 35.2% | |||
| 0049 | Group Anagrams | [Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}}) | Medium | O(n log n) | O(n) | 62.4% | |
| 0073 | Set Matrix Zeroes | [Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}}) | Medium | 46.8% | |||
| 0076 | Minimum Window Substring | [Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}}) | Hard | O(n) | O(n) | ❤️ | 37.9% |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | [Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}}) | Medium | 55.5% | |||
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}}) | Medium | 52.7% | |||
| 0126 | Word Ladder II | [Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}}) | Hard | 25.9% | |||
| 0127 | Word Ladder | [Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}}) | Hard | 33.8% | |||
| 0128 | Longest Consecutive Sequence | [Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}}) | Medium | 48.0% | |||
| 0138 | Copy List with Random Pointer | [Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}}) | Medium | O(n) | O(1) | 44.6% | |
| 0141 | Linked List Cycle | [Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}}) | Easy | 44.3% | |||
| 0142 | Linked List Cycle II | [Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}}) | Medium | 41.9% | |||
| 0146 | LRU Cache | [Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}}) | Medium | 38.4% | |||
| 0160 | Intersection of Two Linked Lists | [Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}}) | Easy | 47.5% | |||
| 0169 | Majority Element | [Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}}) | Easy | 61.5% | |||
| 0187 | Repeated DNA Sequences | [Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}}) | Medium | 43.1% | |||
| 0202 | Happy Number | [Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}}) | Easy | O(log n) | O(1) | 52.2% | |
| 0205 | Isomorphic Strings | [Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}}) | Easy | O(log n) | O(n) | 41.6% | |
| 0208 | Implement Trie (Prefix Tree) | [Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}}) | Medium | 55.8% | |||
| 0217 | Contains Duplicate | [Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}}) | Easy | O(n) | O(n) | 59.1% | |
| 0219 | Contains Duplicate II | [Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}}) | Easy | O(n) | O(n) | 40.1% | |
| 0229 | Majority Element II | [Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}}) | Medium | 40.7% | |||
| 0242 | Valid Anagram | [Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}}) | Easy | O(n) | O(n) | 60.2% | |
| 0264 | Ugly Number II | [Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}}) | Medium | 44.2% | |||
| 0268 | Missing Number | [Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}}) | Easy | 57.7% | |||
| 0290 | Word Pattern | [Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}}) | Easy | O(n) | O(n) | 39.1% | |
| 0347 | Top K Frequent Elements | [Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}}) | Medium | O(n) | O(n) | 63.7% | |
| 0349 | Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}}) | Easy | O(n) | O(n) | 67.5% | |
| 0350 | Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}}) | Easy | O(n) | O(n) | 53.8% | |
| 0387 | First Unique Character in a String | [Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}}) | Easy | 55.6% | |||
| 0389 | Find the Difference | [Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}}) | Easy | 58.8% | |||
| 0395 | Longest Substring with At Least K Repeating Characters | [Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}}) | Medium | 44.2% | |||
| 0409 | Longest Palindrome | [Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}}) | Easy | 52.8% | |||
| 0421 | Maximum XOR of Two Numbers in an Array | [Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}}) | Medium | 55.0% | |||
| 0423 | Reconstruct Original Digits from English | [Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}}) | Medium | 51.5% | |||
| 0424 | Longest Repeating Character Replacement | [Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}}) | Medium | 49.8% | |||
| 0433 | Minimum Genetic Mutation | [Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}}) | Medium | 44.9% | |||
| 0438 | Find All Anagrams in a String | [Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}}) | Medium | O(n) | O(1) | 46.6% | |
| 0447 | Number of Boomerangs | [Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}}) | Medium | O(n) | O(1) | 53.2% | |
| 0448 | Find All Numbers Disappeared in an Array | [Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}}) | Easy | 57.4% | |||
| 0451 | Sort Characters By Frequency | [Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}}) | Medium | O(n log n) | O(1) | 66.8% | |
| 0454 | 4Sum II | [Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}}) | Medium | O(n^2) | O(n) | 55.6% | |
| 0457 | Circular Array Loop | [Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}}) | Medium | 31.1% | |||
| 0460 | LFU Cache | [Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}}) | Hard | 38.4% | |||
| 0480 | Sliding Window Median | [Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}}) | Hard | 40.2% | |||
| 0491 | Increasing Subsequences | [Go]({{< relref "/ChapterFour/0400~0499/0491.Increasing-Subsequences.md" >}}) | Medium | 49.6% | |||
| 0496 | Next Greater Element I | [Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}}) | Easy | 68.6% | |||
| 0500 | Keyboard Row | [Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}}) | Easy | 67.1% | |||
| 0508 | Most Frequent Subtree Sum | [Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}}) | Medium | 61.4% | |||
| 0523 | Continuous Subarray Sum | [Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}}) | Medium | 26.1% | |||
| 0525 | Contiguous Array | [Go]({{< relref "/ChapterFour/0500~0599/0525.Contiguous-Array.md" >}}) | Medium | 44.5% | |||
| 0532 | K-diff Pairs in an Array | [Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}}) | Medium | 37.0% | |||
| 0535 | Encode and Decode TinyURL | [Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}}) | Medium | 83.1% | |||
| 0554 | Brick Wall | [Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}}) | Medium | 52.2% | |||
| 0567 | Permutation in String | [Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}}) | Medium | 44.4% | |||
| 0575 | Distribute Candies | [Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}}) | Easy | 65.1% | |||
| 0594 | Longest Harmonious Subsequence | [Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}}) | Easy | 52.1% | |||
| 0599 | Minimum Index Sum of Two Lists | [Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}}) | Easy | 52.8% | |||
| 0609 | Find Duplicate File in System | [Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}}) | Medium | 63.4% | |||
| 0632 | Smallest Range Covering Elements from K Lists | [Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}}) | Hard | 56.8% | |||
| 0645 | Set Mismatch | [Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}}) | Easy | 41.1% | |||
| 0648 | Replace Words | [Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}}) | Medium | O(n) | O(n) | 60.9% | |
| 0653 | Two Sum IV - Input is a BST | [Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}}) | Easy | 58.0% | |||
| 0676 | Implement Magic Dictionary | [Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}}) | Medium | O(n) | O(n) | 56.1% | |
| 0677 | Map Sum Pairs | [Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}}) | Medium | 56.9% | |||
| 0690 | Employee Importance | [Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}}) | Medium | 61.7% | |||
| 0692 | Top K Frequent Words | [Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}}) | Medium | 53.9% | |||
| 0697 | Degree of an Array | [Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}}) | Easy | 55.2% | |||
| 0705 | Design HashSet | [Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}}) | Easy | 63.8% | |||
| 0706 | Design HashMap | [Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}}) | Easy | 63.8% | |||
| 0710 | Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}}) | Hard | O(n) | O(n) | 33.1% | |
| 0720 | Longest Word in Dictionary | [Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}}) | Medium | O(n) | O(n) | 50.3% | |
| 0726 | Number of Atoms | [Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}}) | Hard | O(n) | O(n) | ❤️ | 51.5% |
| 0748 | Shortest Completing Word | [Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}}) | Easy | 58.4% | |||
| 0752 | Open the Lock | [Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}}) | Medium | 55.0% | |||
| 0763 | Partition Labels | [Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}}) | Medium | 78.4% | |||
| 0767 | Reorganize String | [Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}}) | Medium | 51.2% | |||
| 0771 | Jewels and Stones | [Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}}) | Easy | 87.4% | |||
| 0781 | Rabbits in Forest | [Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}}) | Medium | 55.8% | |||
| 0791 | Custom Sort String | [Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}}) | Medium | 67.6% | |||
| 0792 | Number of Matching Subsequences | [Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}}) | Medium | 49.8% | |||
| 0811 | Subdomain Visit Count | [Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}}) | Medium | 73.1% | |||
| 0815 | Bus Routes | [Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}}) | Hard | 44.6% | |||
| 0817 | Linked List Components | [Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}}) | Medium | 57.9% | |||
| 0819 | Most Common Word | [Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}}) | Easy | 45.3% | |||
| 0820 | Short Encoding of Words | [Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}}) | Medium | 55.1% | |||
| 0823 | Binary Trees With Factors | [Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}}) | Medium | 43.6% | |||
| 0884 | Uncommon Words from Two Sentences | [Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}}) | Easy | 64.9% | |||
| 0888 | Fair Candy Swap | [Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}}) | Easy | 60.0% | |||
| 0890 | Find and Replace Pattern | [Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}}) | Medium | 75.5% | |||
| 0895 | Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}}) | Hard | O(n) | O(n) | 64.2% | |
| 0904 | Fruit Into Baskets | [Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}}) | Medium | 43.1% | |||
| 0911 | Online Election | [Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}}) | Medium | 51.7% | |||
| 0914 | X of a Kind in a Deck of Cards | [Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}}) | Easy | 33.6% | |||
| 0916 | Word Subsets | [Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}}) | Medium | 52.9% | |||
| 0923 | 3Sum With Multiplicity | [Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}}) | Medium | 41.2% | |||
| 0930 | Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}}) | Medium | O(n) | O(n) | ❤️ | 47.3% |
| 0953 | Verifying an Alien Dictionary | [Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}}) | Easy | 52.2% | |||
| 0961 | N-Repeated Element in Size 2N Array | [Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}}) | Easy | 75.1% | |||
| 0966 | Vowel Spellchecker | [Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}}) | Medium | 51.7% | |||
| 0970 | Powerful Integers | [Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}}) | Medium | 43.4% | |||
| 0981 | Time Based Key-Value Store | [Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}}) | Medium | 53.3% | |||
| 0987 | Vertical Order Traversal of a Binary Tree | [Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}}) | Hard | 39.9% | |||
| 0992 | Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}}) | Hard | O(n) | O(n) | ❤️ | 52.6% |
| 1002 | Find Common Characters | [Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}}) | Easy | 68.6% | |||
| 1048 | Longest String Chain | [Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}}) | Medium | 57.0% | |||
| 1054 | Distant Barcodes | [Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}}) | Medium | 45.0% | |||
| 1074 | Number of Submatrices That Sum to Target | [Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}}) | Hard | 65.9% | |||
| 1122 | Relative Sort Array | [Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}}) | Easy | 67.9% | |||
| 1123 | Lowest Common Ancestor of Deepest Leaves | [Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}}) | Medium | 69.1% | |||
| 1128 | Number of Equivalent Domino Pairs | [Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}}) | Easy | 45.8% | |||
| 1160 | Find Words That Can Be Formed by Characters | [Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}}) | Easy | 67.8% | |||
| 1170 | Compare Strings by Frequency of the Smallest Character | [Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}}) | Medium | 60.8% | |||
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | [Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}}) | Medium | 42.0% | |||
| 1178 | Number of Valid Words for Each Puzzle | [Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}}) | Hard | 41.1% | |||
| 1189 | Maximum Number of Balloons | [Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}}) | Easy | 62.5% | |||
| 1202 | Smallest String With Swaps | [Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}}) | Medium | 51.0% | |||
| 1207 | Unique Number of Occurrences | [Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}}) | Easy | 72.4% | |||
| 1275 | Find Winner on a Tic Tac Toe Game | [Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}}) | Easy | 55.7% | |||
| 1396 | Design Underground System | [Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}}) | Medium | 71.7% | |||
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | [Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}}) | Medium | 73.7% | |||
| 1461 | Check If a String Contains All Binary Codes of Size K | [Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}}) | Medium | 54.5% | |||
| 1512 | Number of Good Pairs | [Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}}) | Easy | 87.7% | |||
| 1600 | Throne Inheritance | [Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}}) | Medium | 62.2% | |||
| 1624 | Largest Substring Between Two Equal Characters | [Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}}) | Easy | 59.0% | |||
| 1636 | Sort Array by Increasing Frequency | [Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}}) | Easy | 67.9% | |||
| 1640 | Check Array Formation Through Concatenation | [Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}}) | Easy | 55.4% | |||
| 1656 | Design an Ordered Stream | [Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}}) | Easy | 82.5% | |||
| 1657 | Determine if Two Strings Are Close | [Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}}) | Medium | 54.7% | |||
| 1658 | Minimum Operations to Reduce X to Zero | [Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}}) | Medium | 33.3% | |||
| 1674 | Minimum Moves to Make Array Complementary | [Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}}) | Medium | 36.8% | |||
| 1679 | Max Number of K-Sum Pairs | [Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}}) | Medium | 53.5% | |||
| 1684 | Count the Number of Consistent Strings | [Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}}) | Easy | 81.7% | |||
| 1695 | Maximum Erasure Value | [Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}}) | Medium | 52.2% | |||
| 1742 | Maximum Number of Balls in a Box | [Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}}) | Easy | 73.2% | |||
| 1748 | Sum of Unique Elements | [Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}}) | Easy | 75.0% | |||
| ------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |