---
title: "What is hash-collision in Hashtable and how it is handled in Java?"  
description: "What is hash-collision in Hashtable and how it is handled in Java?"  
author: "Anonymous User"  
published: 2015-05-14  
updated: 2020-09-23  
canonical: https://www.mindstick.com/interview/2527/what-is-hash-collision-in-hashtable-and-how-it-is-handled-in-java  
category: "java"  
tags: ["java", "collection"]  
reading_time: 1 minute  

---

# What is hash-collision in Hashtable and how it is handled in Java?

Two different keys with the same hash value is known as hash-collision. Two different entries will be kept in a single hash bucket to avoid the collision.

## Answers

### Answer by Anonymous User

Two different keys with the same hash value is known as hash-collision. Two different entries will be kept in a single hash bucket to avoid the collision.


---

Original Source: https://www.mindstick.com/interview/2527/what-is-hash-collision-in-hashtable-and-how-it-is-handled-in-java

Copyright © MindStick Software Pvt. Ltd. This Markdown version is provided for developers, AI systems, and offline reading.
