How to Build a Java LRU Cache in 5 Lines
To build a simple Least Recently Used (LRU) cache in Java, extend the standard LinkedHashMap with accessOrder set to true and override the removeEldestEntry method. While this standard library approac
#datastructures
Posts tagged #datastructures
How Java HashMap Prevents Hash Collision DoS Attacks
Java's HashMap mitigates Hash Collision Denial of Service (DoS) attacks by automatically converting congested linked list buckets into Red-Black trees once a bucket exceeds 8 entries and the total map
How Structural Sharing Makes Immutability Fast
If you need to update a single element in an immutable list containing one million items, you do not have to copy all one million elements. Instead, functional ecosystems like Scala, Clojure, and Immu
How Gap Buffers Optimize Text Editor Performance
Gap buffers optimize text editor performance by placing a dynamic, invisible block of empty space (a gap) directly at the cursor's location. Instead of shifting subsequent characters on every keystrok
How Ring Buffers Work: Low-Latency Circular Queues
A ring buffer (or circular queue) prevents media stuttering by managing data streams inside a fixed-size array using two pointers (read and write). By wrapping pointers back to the start when they rea
Skip Lists: The O(log n) Alternative to Balanced Trees
TL;DR: A skip list is a probabilistic data structure that upgrades a standard linked list's O(n) search time to O(log n). By layering multiple sorted "express lane" linked lists on top of each other,
