Day 7 · Sun 2026-10-11 · Synthesis

Synthesis, repair, scorecard evidence, and READY_FOR_REVIEW handoff

Week 11 trains two designs with one operating spine: admission, isolation, durable work, queue/backpressure, streaming/reconnect, derived state, evals, and recovery.

3contiguous 1-D DP slots

25-35mattempt + follow-up window

Staffinvariant, failure, recovery, metrics

Exact Daily Schedule

No drift: the same six blocks run every day.

Time	Block	Contract
08:50-09:00	Target	Write one Staff-level invariant and one failure window before reading.
09:00-10:05	Project design	Repair weak evidence and turn the week into final Staff-ready recall.
10:05-10:45	DDIA / source grounding	Map the design to exact DDIA anchors and only direct applied-AI sources.
10:45-10:55	Spoken close	Record the architecture in English, then say the Chinese invariant aloud.
14:30-16:15	1-D DP contiguous block	Three NeetCode slots below; each slot is 25-35 minutes plus follow-up.
20:30-21:15	Recall / artifact	Run English Senior+/Staff recall and patch the scorecard evidence.

Canonical Hello Interview Anchors

Direct day-page anchors only. Source titles were verified live before build.

No new Hello Interview anchor today; use the mock and scorecard pages.

Exact DDIA Mapping

Only Ch5, Ch9, and Ch13 sections are in scope.

Chapter	Exact section	Interview use
Ch13	数据流系统的正确性	Correctness includes timeliness, completeness, tenant isolation, and recovery after reprocessing.

Applied AI Source Gate

First-party/original sources appear only when they change a serving, eval, security, or operating decision.

No applied-AI source is introduced today unless it changes a concrete serving, eval, security, or operating decision.

21-Slot 1-D DP Runway

Today is slot 19-21 of 21, contiguous across the week.

Block	NeetCode problem	Mode	Invariant	25-35m follow-up	Complexity
14:30-15:05	Counting Bits	Bit recurrence	bits[i] = bits[i >> 1] + (i & 1), preserving prefix work.	Ask for highest-power-of-two variant.	O(n) / O(n)
15:05-15:40	Maximum Profit in Job Scheduling	Weighted interval	Sort by end time; dp[i] picks job i plus best compatible previous profit.	Ask for binary search proof and same-end jobs.	O(n log n) / O(n)
15:40-16:15	Minimum Window Subsequence	Subsequence window DP	Track earliest start for matching prefix; shrink only after full subsequence appears.	Ask for contrast with sliding window substring.	O(mn) / O(n)

Artifacts And Recall

Use these in the evening block and scorecard.

ChatGPT Chinese deep lecture ChatGPT Chinese lecture audio English Senior+/Staff recall script English recall PDF

Required spoken close: explain one invariant, one failure window, one recovery path, and one metric in English. Then restate the same design decision in Chinese without adding new components.

Local study materials
Detailed lecture notes, audio, recall scripts, PDFs, Staff Q&A, and mock packs are archived locally and are intentionally not published on this site.