Algorithms

Table of Contents Introduction Fundamentals of Fragmentation 2.1 External vs. Internal Fragmentation 2.2 Why Fragmentation Matters Types of Defragmentation 3.1 Memory (RAM) Defragmentation 3.2 File‑System Defragmentation 3.3 Flash/SSD Wear‑Leveling & Garbage Collection Classic Defragmentation Algorithms 4.1 Compaction (Sliding‑Window) 4.2 Mark‑Compact (Garbage‑Collector Style) 4.3 Buddy System Coalescing 4.4 Free‑List Merging & Best‑Fit Heuristics Modern & SSD‑Aware Approaches 5.1 Log‑Structured File Systems (LFS) 5.2 Hybrid Defrag for Hybrid Drives 5.3 Adaptive Wear‑Leveling Algorithms Algorithmic Complexity & Trade‑offs Practical Implementation Considerations 7.1 Safety & Consistency Guarantees 7.2 Concurrency & Locking Strategies 7.3 Metrics & Monitoring Case Studies 8.1 Windows NTFS Defragmenter 8.2 Linux ext4 & e4defrag 8.3 SQLite Page Reordering 8.4 JVM Heap Compaction Performance Evaluation & Benchmarks Future Directions 11 Conclusion 12 Resources Introduction Fragmentation is a silent performance killer that plagues virtually every storage medium and memory manager. Whether you are a systems programmer, a database engineer, or a hobbyist tinkering with embedded devices, you will inevitably encounter fragmented memory or files. Defragmentation algorithms—sometimes called compaction or consolidation algorithms—are the tools we use to restore locality, reduce latency, and extend the lifespan of storage media. ...

Introduction In modern computing, distributed systems have become the backbone of everything from cloud services to collaborative editing tools. One of the most fundamental challenges in such environments is determining the order of events that happen across multiple, potentially unreliable nodes. While physical clocks can provide a rough sense of time, they are insufficient for reasoning about causality—the “happened‑before” relationship that underpins consistency guarantees, conflict resolution, and debugging. Enter vector clocks. First introduced in the early 1990s as an extension of Leslie Lamport’s logical clocks, vector clocks give each process a compact, deterministic way to capture causal relationships without requiring synchronized hardware clocks. They are simple enough to implement in a few lines of code, yet powerful enough to underpin the design of large‑scale databases (e.g., Amazon Dynamo, Apache Cassandra), version‑control systems, and real‑time collaborative editors. ...

Table of Contents Introduction Why Rate Limiting Matters in Microservices Fundamental Rate‑Limiting Algorithms 3.1 Fixed Window Counter 3.2 Sliding Window Log 3.3 Sliding Window Counter 3.4 Token Bucket 3.5 Leaky Bucket Challenges of Distributed Environments Designing a Distributed Rate Limiter 5.1 Choosing the Right Data Store 5.2 Consistency Models and Trade‑offs 5.3 Sharding & Partitioning Strategies Implementation Walk‑throughs 6.1 Redis‑Based Token Bucket (Go) 6.2 Apache Cassandra Sliding Window Counter (Java) 6.3 gRPC Interceptor for Centralised Enforcement (Node.js) Testing, Metrics, and Observability Best Practices & Anti‑Patterns Case Study: Scaling Rate Limiting for a Global E‑Commerce Platform Conclusion Resources Introduction Modern applications are increasingly built as collections of loosely coupled microservices that communicate over HTTP/REST, gRPC, or message queues. While this architecture brings agility and scalability, it also introduces new operational challenges—one of the most pervasive being rate limiting. Rate limiting protects downstream services from overload, enforces fair usage policies, and helps maintain a predictable quality of service (QoS) for end‑users. ...

Probabilistic data structures offer approximate answers to complex queries on massive datasets, trading perfect accuracy for dramatic gains in memory efficiency and speed.[3][1] This tutorial progresses from foundational concepts and the simplest structure (Bloom Filter) to advanced ones like HyperLogLog and Count-Min Sketch, complete with math, code examples, and real-world applications. What Are Probabilistic Data Structures? Probabilistic data structures handle big data and streaming applications by using hash functions to randomize and compactly represent sets of items, ignoring collisions while controlling errors within thresholds.[1] Unlike deterministic structures that guarantee exact results, these provide approximations, enabling constant query times and far less memory usage.[1][3] ...

Introduction This comprehensive guide contains 500 curated LeetCode problems organized for efficient interview preparation. Each problem includes: ✅ Interactive checkboxes for progress tracking 🔥 Priority markers for must-solve problems 🟢🟡🔴 Difficulty indicators (Easy/Medium/Hard) Pattern tags for systematic learning Study Recommendations Beginner Path (3-4 months): Start with Easy problems in Array & Hash Table Master Two Pointers and Sliding Window patterns Build foundation with Trees and Linked Lists Practice 2-3 problems daily Intermediate Path (2-3 months): ...