Skip to main content

Posts

Showing posts with the label HashMap Collision Handling

#9/10 | Spring Boot + Docker Compose: 7 Bugs That Broke My First Boot

Part 9 of 10 of Building Instagram's Authentication Backend . If you're just joining, the repo is here and you can catch the earlier parts on the YouTube playlist . Eight parts of code, zero runs By the end of part 8, every layer of this backend existed: DTOs, exceptions, entities, repositories, five services, a security filter chain and a controller. And I had never started the application. Not once. Everything so far was code I'd reasoned through and believed would work. This part is where that belief gets tested. We containerize the app, put Postgres, Redis and a fake mail server next to it, and bring all four up with one command. It did not work the first time, so this post is the real debugging session, with each bug, its symptom and its fix. If you're containerizing your own Spring Boot app, there's a good chance you'll hit at least one of these. In this post: A multi-stage Dockerfile for Spring Boot, line by line A docker-compose.yml ...

Java HashMap Internals Explained in Simple Terms

Java  HashMap  is one of the most frequently asked topics in Java interviews. Many developers use it daily, but very few understand  how it actually works internally . In this article, we will explain: What HashMap is How HashMap stores data internally Role of  hashCode()  and  equals() What collisions are and how they are handled Improvements made in newer Java versions Time complexity of all major operations How to reduce frequent collisions All explanations are in  simple terms , with  examples . 1. What Is a HashMap? A  HashMap  stores data in  key–value pairs . Example: Map<String, Integer> map = new HashMap<>(); map.put("A", 10); map.put("B", 20); Key characteristics: Keys must be  unique Values can be duplicated Order is  not guaranteed One  null key  is allowed Multiple null values are allowed Why HashMap is popular: HashMap provides very fast access to data. 2. How HashMap Stores Data Interna...

Why HashMap Uses (n - 1) & hash and Why Capacity Is Always Power of 2

If you are learning  Java HashMap internals , one line that often confuses beginners is: index = (n - 1) & hash; Many people ask: Where is the  power of 2  here? Why not use  %  (modulo)? Why does HashMap care so much about powers of 2? In this article, we’ll explain everything in  very simple terms . What Is  n  in  (n - 1) & hash ? In this formula: index = (n - 1) & hash; n  is the  capacity of the HashMap , meaning the  number of buckets . Important rule: HashMap capacity is ALWAYS a power of 2 Examples: 16 → 2⁴ 32 → 2⁵ 64 → 2⁶ 128 → 2⁷ So the  power of 2 is hidden inside  n . Why HashMap Capacity Must Be Power of 2 HashMap calculates bucket index using  bitwise AND ( & ) , not modulo ( % ). This works correctly  only when  n  is a power of 2 . Let’s understand this with an example. Example: Capacity = 16 (Power of 2) Binary values: n = 16 → 10000 n - 1 = 15 → 01111 Now sup...