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

docs/content/02-guides/01-coding/04-contiguous-linear/binary-search.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Binary Search'
+description: 'Halving over any monotonic predicate, not just sorted arrays.'
+sidebar:
+  order: 5
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::

docs/content/02-guides/01-coding/04-contiguous-linear/index.mdx

@@ -0,0 +1,21 @@
+---
+title: 'Contiguous Linear'
+description: 'O(1) index access, order is information.'
+sidebar:
+  order: 1
+  label: Introduction
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::
+
+## Patterns
+
+- [Two Pointers](/guides/coding/contiguous-linear/two-pointers) — Converging/parallel index walk that prunes the O(n^2) pair space using order.
+- [Sliding Window](/guides/coding/contiguous-linear/sliding-window) — Two pointers plus incremental state between them.
+- [Prefix Sum](/guides/coding/contiguous-linear/prefix-sum) — Precomputed cumulative state for O(1) range queries.
+- [Binary Search](/guides/coding/contiguous-linear/binary-search) — Halving over any monotonic predicate, not just sorted arrays.
+- [Matrices](/guides/coding/contiguous-linear/matrices) — 2D index arithmetic; often a graph in disguise.
+
+**Systems anchor:** Prefix sum is a materialized view; sliding window is stream processing with an eviction policy.

docs/content/02-guides/01-coding/04-contiguous-linear/matrices.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Matrices'
+description: '2D index arithmetic; often a graph in disguise.'
+sidebar:
+  order: 6
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::

docs/content/02-guides/01-coding/04-contiguous-linear/meta.ts

@@ -0,0 +1,5 @@
+import { defineMeta } from "blume";
+
+export default defineMeta({
+  order: 4,
+});

docs/content/02-guides/01-coding/04-contiguous-linear/prefix-sum.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Prefix Sum'
+description: 'Precomputed cumulative state for O(1) range queries.'
+sidebar:
+  order: 4
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::

docs/content/02-guides/01-coding/04-contiguous-linear/sliding-window.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Sliding Window'
+description: 'Two pointers plus incremental state between them.'
+sidebar:
+  order: 3
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::

docs/content/02-guides/01-coding/04-contiguous-linear/two-pointers.mdx

@@ -0,0 +1,10 @@
+---
+title: 'Two Pointers'
+description: 'Converging/parallel index walk that prunes the O(n^2) pair space using order.'
+sidebar:
+  order: 2
+---
+
+:::warning[Under construction]
+This page is a scaffold. Notes, canonical problems, and template code are not written yet.
+:::