Hash Sets and Hash Maps: O(1) Average-Case Lookups
Master hash table fundamentals, collision handling, load factor, and practical applications of hash sets and maps.
Posts tagged with #data-structures
Heaps: Min-Heaps, Max-Heaps, and Priority Queues
Master heap data structure, heap operations, priority queue implementation, and heap sort with binary and Fibonacci heap variants.
Linked Lists: Singly, Doubly, and Circular Variants
Master linked list operations including insertion, deletion, reversal, cycle detection, and knowing when to use singly, doubly, or circular variants.
Pointers and Memory Management: A Deep Dive
Master pointer arithmetic, memory layout, stack vs heap allocation, and common memory bugs in C/C++ and systems programming.
Red-Black Trees: Balanced Search Trees with Simpler Rotations
Master red-black tree properties, insertion fixup cases, and color flip mechanics. Learn when RB trees outperform AVL and when they don't.
Segment Trees: Range Queries and Updates
Build segment trees for O(log n) range sum, min, max queries with lazy propagation for efficient range updates in competitive programming.
Skip Lists: Layered Linked Lists for Fast Search
Understand skip lists as probabilistic alternatives to balanced trees, providing O(log n) search with simple implementation and lock-free variants.
Sliding Window: Dynamic Subarray Problems
Solve maximum subarray, longest substring, and subarray average problems with O(n) time using the sliding window technique.
Stacks, Queues, and Deques: Sequential Access Data Structures
Master LIFO, FIFO, and double-ended queue operations with implementations, time complexity analysis, and practical applications.
Tries: Prefix Trees for Efficient String Operations
Master trie data structure for prefix matching, autocomplete, and efficient string operations with O(m) complexity where m is key length.