AlgoViz: Interactive Algorithm Visualization Tool

Hashing

Category: Data Structures | Time: O(1) Average | Space: O(n)

Input Data

Visualization

Visual representation of the data structure

Enter key-value pairs to start hashing visualization.

About Hashing

A technique used to map data of an arbitrary size to data of a fixed size. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are used to index a fixed-size table called a hash table.

Code Editor

The code is for reference. Editing it won't affect the visualization.

class HashTable {
    constructor(size) {
        this.table = new Array(size);
        this.size = size;
    }

    hash(key) {
        let hash = 0;
        for (let i = 0; i < key.length; i++) {
            hash = (hash + key.charCodeAt(i) * i) % this.size;
        }
        return hash;
    }

    set(key, value) {
        const index = this.hash(key);
        if(!this.table[index]) {
            this.table[index] = [];
        }
        // ... collision handling to update or push ...
        this.table[index].push({ key, value });
    }

    get(key) {
        const index = this.hash(key);
        // ... collision handling to find the correct item ...
        return this.table[index];
    }
}

Frequently Asked Questions

About Hashing

Two Sum

From: Google

View Question

What is Hashing?

What is a Hash Table?

What is a hash function and what makes a good one?

What is a collision in a hash table?

How can collisions be handled?

What is the time complexity of search, insert, and delete in a hash table?

What is the 'load factor' of a hash table?

When would you use a hash table?

What are some real-world applications of hashing?

Can a hash table store duplicate keys?

Where can I learn more?

Two Sum