A production-grade, pattern-oriented handbook connecting classical computer science algorithms, runtime engine mechanics, and distributed resilience systems to real-world software engineering across backend systems and mobile platforms.
Most standard DSA and system design repositories are split into two disjoint categories:
- Competitive Programming Archives: Solve arbitrary, puzzle-style LeetCode challenges that do not map to real-world code.
- Abstract System Design Templates: Show general block-diagram architectures without connecting them to actual runtime threads, heap limits, and compiler behaviors.
This handbook bridges the gap.
We believe senior software engineers, platform architects, and systems developers need a deep, unified understanding of:
- Algorithmic Optimizations: Monotonic deques, graphs, heaps, and sliding window boundaries.
- Runtime Internals: Generational Garbage Collection, heap fragmentation, stack frame allocation, single-threaded event loops, and coroutine Continuation state machines.
- Concurrency Primitives: Lock-free Compare-And-Swap (CAS), condition variables, counting semaphores, and reactive flow backpressure.
- Distributed Resiliency: State-driven circuit breakers, randomized exponential backoff and jitter, dynamic rate limiting, and write-replication consistency models.
- Engineering Specializations: Scaling stateful WebSockets, API Gateway reverse proxies, client rendering pipelines, outbox synchronization, and decoded image memory limitations.
+---------------------------------------+
| Scalable Systems Handbook Core |
+-------------------+-------------------+
|
+---------------------------------------+---------------------------------------+
| | |
+---------v---------+ +---------v---------+ +---------v---------+
| Algorithmic CS | | Runtime Internals| | Resilient DS |
| - Monotonic Deq | | - Stack vs Heap | | - Circuit Break |
| - Topo Sorting | | - Cheney's GC | | - Jitter Backoff |
| - Sliding Window | | - CPS State Mach | | - Token Bucket |
+---------+---------+ +---------+---------+ +---------+---------+
| | |
+---------------------------------------+---------------------------------------+
|
+---------------+---------------+
| |
+---------v---------+ +---------v---------+
| Backend Scale | | Mobile Systems |
| - Redis Pub/Sub | | - Decoded Memory |
| - Gateway Auth | | - 3-Tree Render |
| - Task Queues | | - Outbox Sync |
+-------------------+ +-------------------+
patterns/: Algorithmic paradigms (two pointers, sliding windows, heaps, trie searches, topological graphs) annotated with complexity charts.runtime-systems/: Memory allocations (stack vs. heap), garbage collection compaction, V8/Dart event loops, and JVM coroutine internals.concurrency/: Mutexes, semaphores, atomic operations, thread coordination, and thread-safe queues.distributed-systems/: Resiliency structures including circuit breakers, retry policies, and dynamic rate limiting.system-design/: Caching topologies (LRU, LFU) and OAuth 2.0 PKCE secure session management.backend-systems/: Horizontal WebSocket architectures, API gateways, background task queues, and telemetry pipelines.mobile-systems/: Low-level client pipelines: custom render passes, image memory metrics, video streaming, and push notification routes.interview-notes/: Technical prep cheat sheets on concurrency, memory leaks, and runtime systems.
- License: MIT License
- Target Audience: Senior Software Engineers, Systems Architects, Mobile Platform Leads, and Distributed Systems Engineers.
| 0001-two-sum |
| 0027-remove-element |
| 0075-sort-colors |
| 0217-contains-duplicate |
| 1470-shuffle-the-array |
| 1920-build-array-from-permutation |
| 1929-concatenation-of-array |
| 1920-build-array-from-permutation |
| 1929-concatenation-of-array |
| 0027-remove-element |
| 0075-sort-colors |
| 0001-two-sum |
| 0217-contains-duplicate |
| 0075-sort-colors |
| 0217-contains-duplicate |