BestHub
Sign in
Tag

collision resolution

0 views collected around this technical thread.

Python Programming Learning Circle
Python Programming Learning Circle
Feb 25, 2025 · Fundamentals

Understanding Hash Tables in Python: Concepts, Operations, and Applications

This article explains the fundamentals of hash tables, covering their definition, advantages, core concepts like hash functions and collision resolution, practical Python dictionary usage with code examples, and common application scenarios such as fast look‑ups, frequency counting, and deduplication.

collision resolutiondata structuresdictionary
0 likes · 5 min read
Understanding Hash Tables in Python: Concepts, Operations, and Applications
IT Services Circle
IT Services Circle
May 11, 2024 · Fundamentals

Hash Table Summit: Storage Structure, Collision Resolution, Mapping, and Resizing

An imaginative conference narrates how various programming language implementations—Go's map, C++'s unordered_map, Java's HashMap, Python's dict, and C#'s HashTable—discuss storage structures, collision‑resolution strategies, hash‑to‑index mapping, and initial capacity and resizing policies, highlighting their differing algorithms and trade‑offs.

Resizingcapacitycollision resolution
0 likes · 9 min read
Hash Table Summit: Storage Structure, Collision Resolution, Mapping, and Resizing
Top Architecture Tech Stack
Top Architecture Tech Stack
Feb 7, 2024 · Fundamentals

Understanding Hash Tables: Concepts, Collision Resolution, and Python Implementations

This article explains the concept of hashing and hash tables, describes their characteristics and common collision‑resolution strategies such as open addressing, linear and quadratic probing, chaining, and rehashing, and provides complete Python implementations including a simple hash class, a dynamic map class, and a custom dictionary.

Pythonchainingcollision resolution
0 likes · 13 min read
Understanding Hash Tables: Concepts, Collision Resolution, and Python Implementations
Selected Java Interview Questions
Selected Java Interview Questions
May 12, 2022 · Fundamentals

How Hash Tables Store Data and Resolve Collisions

This article explains the basic structure of hash tables, how keys are mapped to array indices, the problem of hash collisions, and two common resolution strategies—open addressing and chaining—illustrated with diagrams and a concise summary.

chainingcollision resolutiondata structures
0 likes · 3 min read
How Hash Tables Store Data and Resolve Collisions
Python Programming Learning Circle
Python Programming Learning Circle
Apr 7, 2022 · Fundamentals

Understanding Hash Tables and Implementing Them in Python

This article explains the concept of hashing and hash tables, describes their characteristics and collision‑resolution strategies, showcases practical Python implementations with load‑factor handling and resizing, and highlights common applications such as dictionaries and network session tables.

collision resolutiondata structuresdictionary
0 likes · 13 min read
Understanding Hash Tables and Implementing Them in Python
Java Captain
Java Captain
Mar 13, 2022 · Fundamentals

Understanding the Underlying Data Structure and Mechanics of Java HashMap

This article explains Java HashMap's internal structure, including the array‑linked list and red‑black tree design, load factor, collision resolution methods, resizing process, key selection, thread‑safety concerns, and the hash calculation algorithm, providing detailed insights for developers.

Data StructureHashMapJDK
0 likes · 17 min read
Understanding the Underlying Data Structure and Mechanics of Java HashMap
Architect's Tech Stack
Architect's Tech Stack
Oct 17, 2021 · Fundamentals

Understanding Why HashMap Uses a Load Factor of 0.75 and How It Resolves Collisions

This article explains the purpose of HashMap's load factor, the trade‑offs between space utilization and collision probability, describes common collision‑resolution techniques such as open addressing, rehashing and chaining, and shows why the default load factor of 0.75 is chosen based on Poisson‑distribution analysis.

HashMapJavaPoisson distribution
0 likes · 12 min read
Understanding Why HashMap Uses a Load Factor of 0.75 and How It Resolves Collisions
Top Architect
Top Architect
Mar 21, 2021 · Fundamentals

Why HashMap Uses a Load Factor of 0.75 and How It Handles Collisions

This article explains the purpose of HashMap's load factor, why the default value is 0.75, and describes various collision‑resolution techniques such as open addressing, linear and quadratic probing, rehashing, overflow areas, and chaining, supported by code examples and a Poisson‑distribution analysis.

HashMapJavaPoisson distribution
0 likes · 11 min read
Why HashMap Uses a Load Factor of 0.75 and How It Handles Collisions
Top Architect
Top Architect
Jul 16, 2020 · Fundamentals

Why HashMap Uses a Load Factor of 0.75: Load Factor, Collision Resolution, and the Poisson Distribution

This article explains why Java's HashMap adopts a default load factor of 0.75, describing the concept of load factor, various collision‑resolution strategies such as open addressing and chaining, and how Poisson‑distribution analysis justifies the 0.75 threshold as a balanced trade‑off between space utilization and lookup cost.

HashMapJavaPoisson distribution
0 likes · 11 min read
Why HashMap Uses a Load Factor of 0.75: Load Factor, Collision Resolution, and the Poisson Distribution
vivo Internet Technology
vivo Internet Technology
Apr 22, 2020 · Fundamentals

Hash Table Collisions and Resolution Strategies

The article explains how limited hash spaces cause collisions, then compares open hashing (separate chaining) and closed hashing techniques—linear probing, double hashing, and random hashing—detailing their insertion, search, and deletion algorithms along with the performance trade‑offs and load‑factor analysis for each method.

algorithmcollision resolutiondouble hashing
0 likes · 16 min read
Hash Table Collisions and Resolution Strategies
Tencent IMWeb Frontend Team
Tencent IMWeb Frontend Team
Feb 6, 2018 · Fundamentals

Mastering Hash Tables: Concepts, Collision Resolution, and Popular Hash Functions

This article explains the fundamentals of hash tables, covering their basic concepts, construction methods, various collision‑resolution techniques such as open addressing and chaining, and compares several widely used hash functions with performance insights.

JavaScriptcollision resolutiondata structures
0 likes · 10 min read
Mastering Hash Tables: Concepts, Collision Resolution, and Popular Hash Functions