What is a Hashmap?

Hashmaps are one of the hardest data structures to understand but are also very rewarding once you get the hang of them. Hashmaps work by creation relationships between a key and a value, a value can be accessed or changed at any time if you use its corresponding key. This key-value pair based data structure allows you to access any element in O(1) time complexity, meaning it takes only one instruction to access an element of your choosing in the whole hashmap! This characteristic allows you to find any element in any size hashmap instantly. You may have already used hashmaps in the form of Python dictionaries or C++ unordered maps. As always, let me know in the comments if you have any questions or suggestions for new videos!