---
title: "Hash tables and collision handling"
description: "How can you trace a lookup when hash-table keys collide?"
status: "coming-soon"
language: "en"
canonical: "https://bulnik.dev/en/articles/topics/T54.02/"
topicId: "T54.02"
---

> Coming soon — this article is being prepared. Below are its question, intended outcome, and place in the story.

## The question

How can you trace a lookup when hash-table keys collide?

## What we will work through

Trace a lookup when hash-table keys collide.

## Before you begin

Previously covered: Measuring asymptotic complexity.

- [Measuring asymptotic complexity](/en/articles/topics/T54.01/)