Comment
Author: Admin | 2025-04-28
Map();map.set("hello", "world");console.log(map.get("hello"));Here we take a key-value pair ("hello" → "world") and store it in the map.Then we print out the value associated with the key "hello", which will be"world".A more fun real-world use-case would be to find anagrams. An anagram is when twodifferent words contain the same letters, for example "antlers" and "rentals"or "article" and "recital." If you have a list of words and you want to findall of the anagrams, you can sort the letters in each word alphabetically anduse that as a key in a map.let words = [ "antlers", "rentals", "sternal", "article", "recital", "flamboyant",];let map = new Map();for (let word of words) { let key = word.split("").sort().join(""); if (!map.has(key)) { map.set(key, []); } map.get(key).push(word);}This code results in a map with the following structure:{ "aelnrst": ["antlers", "rentals", "sternal"], "aceilrt": ["article", "recital"], "aabflmnoty": ["flamboyant"]}#Implementing our own simple hash mapHash maps are one of many map implementations, and there are many ways toimplement hash maps. The simplest way, and the way we're going to demonstrate,is to use a list of lists. The inner lists are often referred to as "buckets" inthe real-world, so that's what we'll call them here. A hash function is used onthe key to determine which bucket to store the key-value pair in, then thekey-value pair is added to that bucket.Let's walk through a simple hash map implementation in JavaScript. We're goingto go through it bottom-up, so we'll see some utility methods before getting tothe set and get implementations.class HashMap { constructor() { this.bs = [[], [],
Add Comment