Skip to main content
/Data Structures/Hash Table
1 / 8
Speed
ENES
/
Big O NotationRecursionTwo PointersSliding WindowSpace ComplexityMemoizationGreedy vs DP
StackQueueLinked ListHash TableBinary Search TreeHeap
Bubble SortSelection SortInsertion SortQuick SortMerge SortHeap SortCounting SortRadix SortShell Sort
Binary SearchLinear SearchJump SearchInterpolation Search
Breadth-First SearchDepth-First SearchDijkstra's AlgorithmPrim's AlgorithmTopological Sort
Fibonacci DPKnapsack 0/1Longest Common Subsequence
N-Queens ProblemSudoku SolverMaze Pathfinding
Tower of Hanoi
38 algorithms·by midudev
Hash Table
0
empty
1
empty
2
empty
3
empty
4
empty
5
empty
6
empty
hash(key) = sum of char codes % 7
Step 1:An empty hash table with 7 buckets. The hash function maps keys to bucket indices.
Variables
size==7
entries==0