py/leetcode
1
0 Fork 0
mirror of https://github.com/prdlk/leetcode.git synced 2026-11-03 21:27:48 +00:00
Code Issues Packages Projects Releases Wiki Activity

docs(docs): add strategy, coding, and system design documentation hierarchy

Browse Source
This commit is contained in:
Prad Nukala committed 2026-08-14 18:37:13 -04:00
1 parent 87581c4f4b
commit 91c45ea5de
70 files changed
+1343 -31
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

docs/content/02-guides/02-system-design/index.mdx
+27
View File
@@ -0,0 +1,27 @@
---
title: 'System Design'
description: 'The systems anchor behind each coding family: the same structure, at production scale.'
sidebar:
order: 1
label: Overview
---
:::warning[Under construction]
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
:::
## Systems anchors
- [Materialized Views](/guides/system-design/materialized-views) — Prefix sum as a precomputed, read-optimized projection. *(Contiguous Linear)*
- [Stream Processing](/guides/system-design/stream-processing) — Sliding window as a bounded stream with an eviction policy. *(Contiguous Linear)*
- [Cache Eviction](/guides/system-design/cache-eviction) — LRU cache as a hashmap plus a doubly-linked eviction index. *(Nodal Linear)*
- [Log Compaction](/guides/system-design/log-compaction) — Monotonic stack as dropping entries superseded by newer state. *(Auxiliary Ordering)*
- [Priority Scheduling](/guides/system-design/priority-scheduling) — Heaps behind schedulers, Dijkstra's frontier, and timer wheels. *(Auxiliary Ordering)*
- [Radix Routing Tables](/guides/system-design/radix-routing-tables) — Tries behind routing tables and IPLD path resolution. *(Hierarchical)*
- [B-Tree Indexes](/guides/system-design/btree-indexes) — The BST ordering invariant as a database index. *(Hierarchical)*
- [Dependency Resolution](/guides/system-design/dependency-resolution) — Topological sort as build-graph and package resolution. *(Relational)*
- [Partition Detection](/guides/system-design/partition-detection) — Union-find as dynamic connectivity across a cluster. *(Relational)*
- [Gossip Propagation](/guides/system-design/gossip-propagation) — BFS frontier expansion as epidemic broadcast. *(Relational)*
- [Idempotency Caches](/guides/system-design/idempotency-caches) — A DP memo as an idempotency cache over a deterministic state machine. *(Decision-Space)*
- [Sagas and Compensation](/guides/system-design/sagas-and-compensation) — Backtracking as a saga with compensating undo. *(Decision-Space)*
- [Eventual Consistency](/guides/system-design/eventual-consistency) — Greedy local decisions that provably converge. *(Decision-Space)*