BestHub
Sign in
Tagged articles
16 articles
Page 1 of 1
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-resolutionhash functionhash table
0 likes · 5 min read
Understanding Hash Tables in Python: Concepts, Operations, and Applications
Java Tech Enthusiast
Java Tech Enthusiast
May 12, 2024 · Fundamentals

Hash Table Showdown: How Different Languages Resolve Collisions and Resize

A whimsical yet technical dialogue among Go, C++, Python, Java, and C# representatives reveals the storage structures, collision‑resolution strategies, hash‑to‑index mapping techniques, and resizing policies used in their hash table implementations, highlighting trade‑offs and design choices.

Data Structurecapacitycollision-resolution
0 likes · 9 min read
Hash Table Showdown: How Different Languages Resolve Collisions and Resize
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.

capacitycollision-resolutionhash function
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.

Data Structureschainingcollision-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.

Data Structureschainingcollision-resolution
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.

Data StructuresPythoncollision-resolution
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.

Data StructuresHashMapJava
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
Java Backend Technology
Java Backend Technology
Jul 1, 2020 · Fundamentals

Why Does Java’s HashMap Use a 0.75 Load Factor? The Math Behind It

This article explains why HashMap relies on a 0.75 load factor, how load factor balances space utilization and collision probability, the various collision‑resolution strategies, and the statistical reasoning—particularly Poisson distribution—that led to choosing 0.75 over other values.

HashMapJavacollision-resolution
0 likes · 12 min read
Why Does Java’s HashMap Use a 0.75 Load Factor? The Math Behind It
Programmer DD
Programmer DD
Jun 27, 2020 · Fundamentals

Why Does Java’s HashMap Use a 0.75 Load Factor? The Math Behind It

This article explains why Java's HashMap adopts a default load factor of 0.75, covering hash table basics, collision‑resolution strategies, the Poisson‑distribution analysis that justifies the value, and the trade‑offs between space efficiency and lookup performance.

Data StructuresHashMapJava
0 likes · 11 min read
Why Does Java’s HashMap Use a 0.75 Load Factor? The Math Behind It
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