$ ls -la /posts
total: 7 (tag #data-structures)
$ open windows.mode
Array vs Hash Map Lookup — What Really Wins in Performance?
Why array index lookup often beats hash map lookup in practice, even though both are O(1). Understanding constant factors, CPU cache, and real-world performance.
Array Fundamentals
A complete guide to arrays from first principles — what they are, how they work, common operations, and the core techniques every programmer should know.
Monotonic Stack Pattern
Plain-language guide to using monotonic stacks for one-pass comparisons.
Java HashMap: Understanding equals() and hashCode()
A complete guide to equals() and hashCode() in Java, explaining the contract, how HashMap works internally, common mistakes, and best practices.
Queue Data Structure - Scheduling Your Tasks
Understanding how Queue works as both a computer science concept and a mental model for task scheduling in modern systems.
Heaps in Plain Language: How Computers Always Find the Next Best Thing
Understanding heap data structures and how they efficiently manage priorities in computing systems.
Difference Between Linked List and Array List
Understanding the fundamental differences between linked lists and array lists, their trade-offs, and when to use each data structure.