今日固定时间表
只有三个学习窗口：08:50-10:55、14:30-16:15、20:30-21:15。section links 只放在本日页面。
| 08:50-10:55 | System design 完成 Payment 45m mock 与 Ad Click 45m mock；每场记录两个 deep dives、hard fail、lowest dimension。余下 35 分钟写证据。 |
|---|---|
| 14:30-16:15 | NeetCode Linked List 三道连续题位，每题 30m solve + 5m pattern/invariant/bug/complexity evidence。 |
| 20:30-21:15 | Recall / Staff Q&A / Mock 完成 Metrics Monitoring 45m mock；最后写一条 cross-system conclusion：correctness source 与 low-latency view 的边界。 |
算法模块
连续 NeetCode Linked List tag；每天恰好 3 个 slot。
| # | Problem / mode | Pattern | Invariant | Bug risk | Time | Space |
|---|---|---|---|---|---|---|
| 16 | Sort List NEW · 30m solve + 5m evidence | merge sort on linked list | split halves shrink until single nodes | not breaking mid.next | O(n log n) | O(log n) |
| 17 | Partition List NEW · 30m solve + 5m evidence | two stable lists | before list has < x, after list has >= x | not terminating after tail | O(n) | O(1) |
| 18 | Rotate List NEW · 30m solve + 5m evidence | length + ring break | new tail is length - k%length - 1 | k greater than length | O(n) | O(1) |
DDIA 精确决策卡
只读 Ch8、Ch12、Ch13 中能改变今天设计选择的小节。
| 项目问题 | 精确 DDIA subsection | 改变的系统决定 |
|---|---|---|
| Three mocks must separate correctness from fresh views | Ch13 · 数据库的端到端原则 | end-to-end idempotency and reconciliation live above individual storage/stream tools |
本日项目 artifacts
今日产出、修复与英语 recall
| 必须交付 | 三张 mock evidence sheet：每场 100 分，两个 deep dives，各自一个 repair sentence。 |
|---|---|
| 修复规则 | 如果回答只说组件名，重写为 decision -> mechanism -> invariant -> failure window -> recovery -> metric。 |
| English recall | Correctness is the durable source of truth; low-latency status, aggregates, dashboards, and alerts are views with freshness and repair semantics. |
Detailed lecture notes, audio, recall scripts, PDFs, Staff Q&A, and mock packs are archived locally and are intentionally not published on this site.