mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-15 08:30:12 +08:00
9.3 KiB
9.3 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/0000~0099/0001.Two-Sum.md" >}}) | Easy | O(n) | O(n) | 46.3% | |
| 0003 | Longest Substring Without Repeating Characters | [Go]({{< relref "/ChapterFour/0000~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}}) | Medium | O(n) | O(1) | ❤️ | 31.3% |
| 0018 | 4Sum | [Go]({{< relref "/ChapterFour/0000~0099/0018.4Sum.md" >}}) | Medium | O(n^3) | O(n^2) | ❤️ | 34.7% |
| 0030 | Substring with Concatenation of All Words | [Go]({{< relref "/ChapterFour/0000~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}}) | Hard | O(n) | O(n) | ❤️ | 26.1% |
| 0036 | Valid Sudoku | [Go]({{< relref "/ChapterFour/0000~0099/0036.Valid-Sudoku.md" >}}) | Medium | O(n^2) | O(n^2) | 50.3% | |
| 0037 | Sudoku Solver | [Go]({{< relref "/ChapterFour/0000~0099/0037.Sudoku-Solver.md" >}}) | Hard | O(n^2) | O(n^2) | ❤️ | 46.1% |
| 0049 | Group Anagrams | [Go]({{< relref "/ChapterFour/0000~0099/0049.Group-Anagrams.md" >}}) | Medium | O(n log n) | O(n) | 59.0% | |
| 0076 | Minimum Window Substring | [Go]({{< relref "/ChapterFour/0000~0099/0076.Minimum-Window-Substring.md" >}}) | Hard | O(n) | O(n) | ❤️ | 35.8% |
| 0094 | Binary Tree Inorder Traversal | [Go]({{< relref "/ChapterFour/0000~0099/0094.Binary-Tree-Inorder-Traversal.md" >}}) | Medium | O(n) | O(1) | 65.5% | |
| 0136 | Single Number | [Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}}) | Easy | 66.4% | |||
| 0138 | Copy List with Random Pointer | [Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}}) | Medium | O(n) | O(1) | 39.7% | |
| 0187 | Repeated DNA Sequences | [Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}}) | Medium | 41.3% | |||
| 0202 | Happy Number | [Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}}) | Easy | O(log n) | O(1) | 51.1% | |
| 0204 | Count Primes | [Go]({{< relref "/ChapterFour/0200~0299/0204.Count-Primes.md" >}}) | Easy | 32.2% | |||
| 0205 | Isomorphic Strings | [Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}}) | Easy | O(log n) | O(n) | 40.4% | |
| 0217 | Contains Duplicate | [Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}}) | Easy | O(n) | O(n) | 56.6% | |
| 0219 | Contains Duplicate II | [Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}}) | Easy | O(n) | O(n) | 38.5% | |
| 0242 | Valid Anagram | [Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}}) | Easy | O(n) | O(n) | 58.0% | |
| 0274 | H-Index | [Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}}) | Medium | O(n) | O(n) | 36.3% | |
| 0290 | Word Pattern | [Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}}) | Easy | O(n) | O(n) | 38.3% | |
| 0347 | Top K Frequent Elements | [Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}}) | Medium | O(n) | O(n) | 62.3% | |
| 0349 | Intersection of Two Arrays | [Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}}) | Easy | O(n) | O(n) | 64.5% | |
| 0350 | Intersection of Two Arrays II | [Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}}) | Easy | O(n) | O(n) | 51.9% | |
| 0387 | First Unique Character in a String | [Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}}) | Easy | 53.7% | |||
| 0389 | Find the Difference | [Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}}) | Easy | 57.7% | |||
| 0409 | Longest Palindrome | [Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}}) | Easy | 52.2% | |||
| 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) | 44.8% | |
| 0447 | Number of Boomerangs | [Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}}) | Medium | O(n) | O(1) | 52.4% | |
| 0451 | Sort Characters By Frequency | [Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}}) | Medium | O(n log n) | O(1) | 64.2% | |
| 0454 | 4Sum II | [Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}}) | Medium | O(n^2) | O(n) | 54.5% | |
| 0463 | Island Perimeter | [Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}}) | Easy | 66.6% | |||
| 0500 | Keyboard Row | [Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}}) | Easy | 65.5% | |||
| 0508 | Most Frequent Subtree Sum | [Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}}) | Medium | 58.9% | |||
| 0575 | Distribute Candies | [Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}}) | Easy | 61.9% | |||
| 0594 | Longest Harmonious Subsequence | [Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}}) | Easy | 47.8% | |||
| 0599 | Minimum Index Sum of Two Lists | [Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}}) | Easy | 51.5% | |||
| 0632 | Smallest Range Covering Elements from K Lists | [Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}}) | Hard | 54.0% | |||
| 0645 | Set Mismatch | [Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}}) | Easy | 42.5% | |||
| 0648 | Replace Words | [Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}}) | Medium | O(n) | O(n) | 58.3% | |
| 0676 | Implement Magic Dictionary | [Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}}) | Medium | O(n) | O(n) | 55.2% | |
| 0705 | Design HashSet | [Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}}) | Easy | 64.6% | |||
| 0706 | Design HashMap | [Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}}) | Easy | 62.6% | |||
| 0710 | Random Pick with Blacklist | [Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}}) | Hard | O(n) | O(n) | 32.6% | |
| 0718 | Maximum Length of Repeated Subarray | [Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}}) | Medium | 50.2% | |||
| 0720 | Longest Word in Dictionary | [Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}}) | Easy | O(n) | O(n) | 49.1% | |
| 0726 | Number of Atoms | [Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}}) | Hard | O(n) | O(n) | ❤️ | 51.0% |
| 0739 | Daily Temperatures | [Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}}) | Medium | O(n) | O(n) | 64.4% | |
| 0748 | Shortest Completing Word | [Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}}) | Easy | 57.4% | |||
| 0771 | Jewels and Stones | [Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}}) | Easy | 86.9% | |||
| 0781 | Rabbits in Forest | [Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}}) | Medium | 55.4% | |||
| 0811 | Subdomain Visit Count | [Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}}) | Easy | 71.3% | |||
| 0884 | Uncommon Words from Two Sentences | [Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}}) | Easy | 64.0% | |||
| 0895 | Maximum Frequency Stack | [Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}}) | Hard | O(n) | O(n) | 62.2% | |
| 0930 | Binary Subarrays With Sum | [Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}}) | Medium | O(n) | O(n) | ❤️ | 44.4% |
| 0953 | Verifying an Alien Dictionary | [Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}}) | Easy | 52.4% | |||
| 0961 | N-Repeated Element in Size 2N Array | [Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}}) | Easy | 74.4% | |||
| 0970 | Powerful Integers | [Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}}) | Easy | 39.9% | |||
| 0981 | Time Based Key-Value Store | [Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}}) | Medium | 54.0% | |||
| 0992 | Subarrays with K Different Integers | [Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}}) | Hard | O(n) | O(n) | ❤️ | 50.5% |
| 1002 | Find Common Characters | [Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}}) | Easy | 68.2% | |||
| 1078 | Occurrences After Bigram | [Go]({{< relref "/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md" >}}) | Easy | 64.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.6% | |||
| 1189 | Maximum Number of Balloons | [Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}}) | Easy | 61.7% | |||
| 1207 | Unique Number of Occurrences | [Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}}) | Easy | 71.6% | |||
| 1512 | Number of Good Pairs | [Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}}) | Easy | 87.8% | |||
| 1539 | Kth Missing Positive Number | [Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}}) | Easy | 55.2% | |||
| 1640 | Check Array Formation Through Concatenation | [Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}}) | Easy | 60.5% | |||
| 1679 | Max Number of K-Sum Pairs | [Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}}) | Medium | 54.3% | |||
| ------------ | ------------------------------------------------------- | ------- | ---------------- | --------------- | ------------- | ------------- | ------------- |