Why this matters
- put/get/remove with expected O(1) average time
- Scope — what "Segments" covers inside Concurrent Hash Map and what it does not
- Scope — what "Resize" covers inside Concurrent Hash Map and what it does not
- Scope — what "vs ConcurrentHashMap" covers inside Concurrent Hash Map and what it does not
- In-memory systems test data structures + thread safety together.
Segment 0
Segment 1
Segment 2
CampusOS context
CampusOS is the fictional smart-campus platform used across this track. Treat this module as a real product slice:
Context
- Belongs to CampusOS — same naming and design vocabulary as parking, library, and booking modules
- Scope is one JVM — persistence is in-memory or behind a repository interface
- Goal is a class diagram + core Java that an interviewer can follow in 35–45 minutes
- Extension paragraph at the end links to System Design when scale exceeds one process
Requirements snapshot
Functional requirements
- put/get/remove with expected O(1) average time
- Thread-safe under concurrent writers
- resize when load factor exceeded
- Optional: computeIfAbsent atomic operation
Non-functional requirements
- Single JVM, in-process design for this LLD article
- Core flows testable with in-memory repositories
- Extension points for new rules without editing central god classes
- Clear public API on facade/service layer
- CampusOS extension links to System Design when scale demands distribution
The rest of this guide is part of Pro
Free covers every fresher guide in full. Pro unlocks Senior, Staff and Architect guides across every track.
Still to come · 6 sections
- Overview
- Requirements
- Segments
- Resize
- vs ConcurrentHashMap
- CampusOS extension
Test yourself
Answer these before moving on — recall is what makes it stick.