mirror of
https://github.com/prdlk/leetcode.git
synced 2026-11-03 05:27:36 +00:00
docs(docs): add strategy, coding, and system design documentation hierarchy
This commit is contained in:
1 parent
87581c4f4b
commit
91c45ea5de
70 files changed
+1343
-31
No files matched your search
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'Backtracking'
|
||||
description: 'DFS over the state tree with undo; exhaustive enumeration.'
|
||||
sidebar:
|
||||
order: 2
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'Dynamic Programming'
|
||||
description: 'Backtracking plus memoization over overlapping subproblems.'
|
||||
sidebar:
|
||||
order: 3
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'Greedy'
|
||||
description: 'DP where the local optimum provably suffices, so no memo is needed.'
|
||||
sidebar:
|
||||
order: 4
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
@@ -0,0 +1,19 @@
|
||||
---
|
||||
title: 'Decision-Space'
|
||||
description: 'Nodes are states, not data. The structure does not exist until you walk it.'
|
||||
sidebar:
|
||||
order: 1
|
||||
label: Introduction
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
|
||||
## Patterns
|
||||
|
||||
- [Backtracking](/guides/coding/decision-space/backtracking) — DFS over the state tree with undo; exhaustive enumeration.
|
||||
- [Dynamic Programming](/guides/coding/decision-space/dynamic-programming) — Backtracking plus memoization over overlapping subproblems.
|
||||
- [Greedy](/guides/coding/decision-space/greedy) — DP where the local optimum provably suffices, so no memo is needed.
|
||||
|
||||
**Systems anchor:** DP memo is an idempotency cache; backtracking is a saga with compensating undo; greedy is local decisions that converge.
|
||||
@@ -0,0 +1,5 @@
|
||||
import { defineMeta } from "blume";
|
||||
|
||||
export default defineMeta({
|
||||
order: 9,
|
||||
});
|
||||
Reference in new issue
Block a user