Search⌘ K
Home
Courses
Data Structures for Coding Interviews in JavaScript

Collisions in Hash Tables

Explore how to manage collisions in hash tables by understanding strategies like linear probing, chaining, and resizing arrays. Learn how these approaches work to handle overlapping indices and improve hash table performance in JavaScript.

We'll cover the following...

When you map large keys into a small range of numbers from 0-N, where N is the size of the array, there is a huge possibility that two different keys may return the same index. This phenomenon is called collision.

Strategies to Handle Collisions #

There are several ways to work around collisions in the array. The three most common strategies are:

  • Linear Probing
  • Chaining
  • Resizing the array

Linear Probing #

...