Data Structures/Hash Table
hashkey-valueO(1)-lookup
Press play to start
1void insert(const char* key, const char* val) {
2 int i = hashKey(key);
3 strcpy(table[i][sizes[i]].key, key);
4 strcpy(table[i][sizes[i]++].val, val);
5}
Step 1/0

Practice

LeetCode·#1 Two SumEasyHackerRank·Sherlock and AnagramsMediumNeetCode·Two SumEasy
OperationBestAverageWorst
insertO(1)O(1)O(n)
removeO(1)O(1)O(n)
searchO(1)O(1)O(n)
SpaceO(n)