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.
Posts tagged with #algorithms
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.
Sorting Algorithm Comparison: When to Use Which
Compare all major sorting algorithms by time complexity, space usage, stability, and practical use cases.
Topological Sort: Ordering Directed Acyclic Graphs
Learn topological sorting using DFS and Kahn's algorithm for dependency resolution in directed acyclic graphs.
Two Pointers Technique: Efficient Array Traversal
Master the two pointers technique for O(1) space complexity solutions to array problems like pair sum, palindrome check, and triplet finding.
Load Balancing Algorithms: Round Robin, Least Connections, and Beyond
Explore load balancing algorithms used in microservices including round robin, least connections, weighted, IP hash, and adaptive algorithms.
Cache Eviction Policies: LRU, LFU, FIFO, and Beyond
A comprehensive guide to cache eviction policies — LRU, LFU, FIFO, Random — with implementation trade-offs, decision frameworks, and real-world case studies.