Skip to content

Latest commit

 

History

History
43 lines (41 loc) · 4.15 KB

Hash_Table.md

File metadata and controls

43 lines (41 loc) · 4.15 KB
title type
Hash Table
docs

Hash Table

Title Solution Difficulty Time Space 收藏
1. Two Sum [Go]({{< relref "/ChapterFour/0001.Two-Sum.md" >}}) Easy O(n) O(n)
3. Longest Substring Without Repeating Characters [Go]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}}) Medium O(n) O(1) ❤️
18. 4Sum [Go]({{< relref "/ChapterFour/0018.4Sum.md" >}}) Medium O(n^3) O(n^2) ❤️
30. Substring with Concatenation of All Words [Go]({{< relref "/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md" >}}) Hard O(n) O(n) ❤️
36. Valid Sudoku [Go]({{< relref "/ChapterFour/0036.Valid-Sudoku.md" >}}) Medium O(n^2) O(n^2)
37. Sudoku Solver [Go]({{< relref "/ChapterFour/0037.Sudoku-Solver.md" >}}) Hard O(n^2) O(n^2) ❤️
49. Group Anagrams [Go]({{< relref "/ChapterFour/0049.Group-Anagrams.md" >}}) Medium O(n log n) O(n)
76. Minimum Window Substring [Go]({{< relref "/ChapterFour/0076.Minimum-Window-Substring.md" >}}) Hard O(n) O(n) ❤️
94. Binary Tree Inorder Traversal [Go]({{< relref "/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md" >}}) Medium O(n) O(1)
138. Copy List with Random Pointer Go Medium O(n) O(1)
202. Happy Number [Go]({{< relref "/ChapterFour/0202.Happy-Number.md" >}}) Easy O(log n) O(1)
205. Isomorphic Strings [Go]({{< relref "/ChapterFour/0205.Isomorphic-Strings.md" >}}) Easy O(log n) O(n)
217. Contains Duplicate [Go]({{< relref "/ChapterFour/0217.Contains-Duplicate.md" >}}) Easy O(n) O(n)
219. Contains Duplicate II [Go]({{< relref "/ChapterFour/0219.Contains-Duplicate-II.md" >}}) Easy O(n) O(n)
242. Valid Anagram [Go]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}}) Easy O(n) O(n)
274. H-Index [Go]({{< relref "/ChapterFour/0274.H-Index.md" >}}) Medium O(n) O(n)
290. Word Pattern [Go]({{< relref "/ChapterFour/0290.Word-Pattern.md" >}}) Easy O(n) O(n)
347. Top K Frequent Elements [Go]({{< relref "/ChapterFour/0347.Top-K-Frequent-Elements.md" >}}) Medium O(n) O(n)
349. Intersection of Two Arrays [Go]({{< relref "/ChapterFour/0349.Intersection-of-Two-Arrays.md" >}}) Easy O(n) O(n)
350. Intersection of Two Arrays II [Go]({{< relref "/ChapterFour/0350.Intersection-of-Two-Arrays-II.md" >}}) Easy O(n) O(n)
438. Find All Anagrams in a String [Go]({{< relref "/ChapterFour/0438.Find-All-Anagrams-in-a-String.md" >}}) Easy O(n) O(1)
447. Number of Boomerangs [Go]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}}) Easy O(n) O(1)
451. Sort Characters By Frequency [Go]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}}) Medium O(n log n) O(1)
454. 4Sum II [Go]({{< relref "/ChapterFour/0454.4Sum-II.md" >}}) Medium O(n^2) O(n)
648. Replace Words [Go]({{< relref "/ChapterFour/0648.Replace-Words.md" >}}) Medium O(n) O(n)
676. Implement Magic Dictionary [Go]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}}) Medium O(n) O(n)
720. Longest Word in Dictionary [Go]({{< relref "/ChapterFour/0720.Longest-Word-in-Dictionary.md" >}}) Easy O(n) O(n)
726. Number of Atoms [Go]({{< relref "/ChapterFour/0726.Number-of-Atoms.md" >}}) Hard O(n) O(n) ❤️
739. Daily Temperatures [Go]({{< relref "/ChapterFour/0739.Daily-Temperatures.md" >}}) Medium O(n) O(n)
710. Random Pick with Blacklist [Go]({{< relref "/ChapterFour/0710.Random-Pick-with-Blacklist.md" >}}) Hard O(n) O(n)
895. Maximum Frequency Stack [Go]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}}) Hard O(n) O(n)
930. Binary Subarrays With Sum [Go]({{< relref "/ChapterFour/0930.Binary-Subarrays-With-Sum.md" >}}) Medium O(n) O(n) ❤️
992. Subarrays with K Different Integers [Go]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}}) Hard O(n) O(n) ❤️
--------------------------------------- --------------------------------- -------------------------- ----------------------- ----------- --------