JavaScript: Hashmaps

Course details

Hashmaps are a very useful data structure in programming languages. In JavaScript, data is stored in key-value pairs, using hashmaps to allow for quick retrieval of data. In this course, software engineer and web evangelist Tiffany Graves covers what hashmaps are and why they are used. Learn how the built-in functions for hashmaps, get() and set(), offer quick data retrieval, which leads to an optimal time complexity. Explore the relatively optimal space complexity of Hashmaps in JavaScript, as well. Plus, dive into a discussion of hashing and the basics of what a hash function is.

Learning objectives
Create a hashmap.
Use built-in functions to store and retrieve data.
Discover how to explain what time complexity is and what it is for hashmaps.
Demonstrate what the purpose of hashing is and what hash functions are for at a beginner level.

Concepts

0. Introduction

01 - Hashmaps can level up your development

1. What Are Hashmaps

02 - So are these the data structures too
03 - Differences between hashmaps and arrays in JavaScript
04 - What Hashmaps are useful for
05 - Do I need to know how to create a hash function
06 - Challenge - Do you know what hashmaps are
07 - Solution - Hashmaps 1

2. Built-In Functions

08 - Get method
09 - Set method
10 - Clear method and delete method
11 - Challenge - Methods challenge
12 - Solution - Hashmaps 2

3. Hashing - Hash Functions

13 - What is hashing
14 - What is a hash function
15 - Challenge - Identify a dictionary cyberattack
16 - Solution - Identify a dictionary cyberattack

4. Time and Space Complexity

17 - Time complexity for hashmaps
18 - Challenge - Time and space complexity challenge
19 - Solution - Time and space complexity

Conclusion

20 - Next steps

JavaScript: Hashmaps

Authors

Tiffany Graves