Lesson clarity and reading experience review
Reviewed 2026-09-24. This is an editorial record, not a publishing requirement.
Scope and standard
This pass covers 196 teaching, navigation and practice-support pages outside the 90 project/design briefs tracked in the project review and the follow-up review. Each page was read for its purpose, starting context, assignment, examples, prerequisites and connection to supplied code. Existing strong explanations were retained. This is not a claim that every reference implementation or every external service was exercised.
The approved request-tracing introduction is the quality reference. A reader should be able to name the application, follow a concrete input to a result, find the code, distinguish supplied behavior from their task, and explain where a local mechanism ends and a proposed deployment begins. UI behavior should be visible. Workload numbers should have units and explicit assumptions. A larger follow-up should explain the changed failure boundary and show the revised design.
Changes that affect the reading experience
- Five screenshots captured from the actual bookmark editor show loaded results, a pending save, a completed earlier save with a newer draft, an empty search, and a controlled error. The error response and held save response are explicitly described as controlled scenarios.
- Part A–D, CH 01–18, and chapter.lesson addresses distinguish navigation levels. Sections use their titles under On this page. Chapter introductions now survive the reader’s overview rendering and appear before the lesson list.
- Concept lessons use application examples, data records, request/response shapes, logs, state traces or calculations where those clarify the mechanism. They do not all use an identical template.
- Older workshop collections now point to the real starting code and worked mechanisms. Answer keys remain separate from candidate assignments. Historical implementation evidence keeps its original dates and scope.
- Corrected concrete inconsistencies in stream assembly, descending pagination, interval boundaries, tie examples, prerequisite links and sampling explanations.
Simulated reading walkthrough
These are editorial perspectives, not external user research.
| Reader question | Outcome of the revision |
|---|---|
| Junior: what is this application doing? | Product context comes before the failure or architecture question. HTTP examples and visible editor states show what save, title lookup, confirmed state and draft mean. |
| Junior: what do I do first? | Concept tasks, runnable lab instructions, candidate briefs and reference pages identify different starting actions. Chapter landing pages introduce the topic before listing lessons. |
| Junior: where is the UI? | The frontend chapter, browser-state lesson, editor lab and full-stack practice include actual application screenshots. |
| Senior: which guarantees does the supplied code provide? | Local fixtures, proposed adapters, storage authority, uncertain responses and cloud resources are distinguished. Supplied code is linked directly. |
| Senior: why add this mechanism? | Workload assumptions and changed requirements identify the failure or capacity boundary. Worked extensions show the revised flow and its limits. |
| Either reader: where am I? | Part, chapter, lesson and section labels use different notation and visual treatment. |
Direct publication checks
The final site build produced 331 content pages, 248 guided steps and 311 Mermaid diagrams, with no diagram-render failures. Twelve representative pages were opened at 390 px and 1440 px, including the homepage, chapter introductions, UI lesson, HTTP/database lessons, AWS lab, incident exercise, workshop collection, company rehearsal, candidate brief and queue lesson. Their images decoded, section links resolved and page bodies stayed within the viewport. Rendered local links and image destinations were inspected across all output HTML with no unresolved destinations.
No tests were added or run for this pass. No scheduled checks, publishing gates or workflow changes were introduced. The screenshots came from the running editor. Cloud deployment and external accessibility audits are outside these checks.
Page-by-page disposition
| Page | Disposition | Review outcome |
|---|---|---|
| The Engineering Interview Curriculum | improved | Aligned source navigation with Part A–D, globally numbered chapters and chapter.lesson addresses. Explained how concepts, labs and briefs differ. |
| Coding and problem solving | improved | Introduced the part through concrete work and prerequisites. Source chapter indexes match the global chapter numbers. |
| AI-assisted code changes | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Make code changes reviewable and recoverable | improved | Compare the patch with the behavior being requested plus descriptive title and application context. |
| Specify and verify an AI-generated change | improved | See why a plausible one-line implementation loses zero plus descriptive title and application context. |
| Repair a quantity update that loses zero | improved | Your starting input and finish line plus descriptive title and application context. |
| Estimate request rates, storage, latency and availability | improved | Added an explicit starting example and assignment: Start with the user action and the unit. |
| Practice specification, AI review and independent evidence | improved | Reviewed every linked project route and replaced vague collection/section titles with the actual task. Detailed assignments remain in the linked canonical pages. |
| Practice reviewable changes and integration decisions | improved | Reviewed every linked project route and replaced vague collection/section titles with the actual task. Detailed assignments remain in the linked canonical pages. |
| Data structures and algorithms | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Cost: count the work and the memory | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Arrays and strings: keep order and boundaries | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Sets: remember membership | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Maps: remember earlier work | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Stacks: keep unresolved work | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Queues and deques: control who goes next | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Linked lists: preserve the reachable chain | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Trees: carry context down, combine answers up | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Heaps: keep the next best candidate | improved | Corrected an absent bound reference and a link to the wrong top-k problem. Kept the worked heap trace. |
| Tries: share prefixes without losing whole words | improved | Added a concrete situation and a clear learning action before introducing the structure. |
| Graphs: visit once, then track prerequisites | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Union-find: track components as links arrive | improved | Added a concrete situation and a clear learning action before introducing the structure. |
| Weighted paths: expand the cheapest candidate | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Sorting: pay once to expose order | improved | Added a concrete situation and a clear learning action before introducing the structure. |
| Sorted data: binary search and intervals | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Two pointers: discard work with a reason | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Windows: move boundaries, avoid rescanning | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Prefix sums: count possible starts | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Greedy choices: prove the local step is safe | improved | Added a concrete situation and a clear learning action before introducing the structure. |
| Search: choose, recurse, undo | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Dynamic programming: define a smaller problem | reviewed-retained | Existing lesson already provides a concrete input/output, defined state, runnable core, hand trace, visual, boundary cases and changed requirement. Retained to avoid duplicating explanation. |
| Bit operations: represent independent flags | improved | Added a worked state trace or decision example tied to the existing code and visual. |
| Choose the structure from the repeated question | improved | Added a concrete situation and a clear learning action before introducing the structure. |
| Explain algorithm invariants and the changes that invalidate them | improved | Added an explicit starting example and assignment: Compare the state, not just the code. |
| Choose a coding problem and work through its contract | improved | Added an explicit starting example and assignment: Your first complete attempt. |
| Two sum: remember the useful past | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A reconciliation tool receives signed transaction amounts. Find two different positions whose amounts total a requested adjustment. Return the first pair found while scanning rightward. What should happen when amounts repeat or no pair exists? Existing worked reference and changed requirements retained. |
| Valid anagram: equality of multiplicities | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A word-game service checks whether two submitted strings use exactly the same characters, including repetitions. Spaces and case currently matter. Implement the check and ask whether “character” means a Unicode code point or a user-visible letter. Existing worked reference and changed requirements retained. |
| Group anagrams: canonical keys | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. The word-game service now receives a batch of words and must place words with identical character inventories together. Preserve duplicate entries and make output deterministic. How can you avoid checking every word against every previous word? Existing worked reference and changed requirements retained. |
| Longest unique window: move the boundary forward | improved | Replaced a purported tie example that had a unique maximum with an actual tied input and exact returned positions. |
| Minimum covering window: track unmet demand | improved | Made surplus and tie rows concrete with exact inputs and half-open output positions. |
| Count target-sum subarrays: differences of prefixes | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A ledger contains signed daily adjustments. Count every nonempty contiguous date range whose total equals a target. Refunds create negative values, and zero-value days still count. Can a window that is too large always be repaired by removing its leftmost entry? Existing worked reference and changed requirements retained. |
| Product except self: combine independent summaries | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. An analysis routine needs, at every position, the product of all other entries. Division is forbidden because zero is valid. Return a fresh list while using constant extra working storage beyond that output. What should one empty side contribute? Existing worked reference and changed requirements retained. |
| Longest consecutive run: expand only from starts | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. An importer receives integer record numbers in arbitrary order, with duplicates. Report the length of the longest gap-free run of distinct numbers. Adjacent input positions do not matter. Can you avoid sorting without repeatedly walking the same run? Existing worked reference and changed requirements retained. |
| Merge intervals: preserve the covered set | improved | Corrected a closed-versus-half-open contradiction. Preserved the explicit merge-touching contract and worked boundary table. |
| Meeting room capacity: count simultaneous demand | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. An office scheduler needs the minimum number of interchangeable rooms for a batch of meetings. A room can be reused exactly when its previous meeting ends. Return capacity, not assignments. Why does merging busy intervals lose the quantity we need? Existing worked reference and changed requirements retained. |
| Binary search boundary: find the first true position | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A sorted price list may contain duplicates. Return the insertion position immediately before every price equal to a target, or before the next larger price when the target is absent. Define what you return beyond either end, then explain why each search update is safe. Existing worked reference and changed requirements retained. |
| Rotated array search: identify the ordered half | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A device stores distinct sorted sequence numbers in a circular array, then exports them starting from an arbitrary position. Find a target in that exported order. How does the midpoint tell you which half still has ordinary sorted order? Existing worked reference and changed requirements retained. |
| Shipping capacity: search a feasible answer | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A warehouse must ship packages in their listed order within a fixed number of days. Each day loads the next consecutive packages up to one common capacity. Find the smallest integer capacity that works. Why can you test a proposed capacity greedily? Existing worked reference and changed requirements retained. |
| Reverse a linked list: keep the unprocessed suffix reachable | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A singly linked work queue must be reversed in place. Each node has a value and a link to the next node. Return the new head using the same node objects, with every link reversed. How will you preserve access to the remaining queue before overwriting a link? Existing worked reference and changed requirements retained. |
| Cycle entry: relative motion and identity | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A corrupted linked queue may loop forever. Return the exact node where traversal from its head first enters a cycle, or None when it terminates. Use constant working space and do not modify the queue. Why is returning the first slow/fast meeting point insufficient? Existing worked reference and changed requirements retained. |
| Merge sorted lists: splice only a safe frontier | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. Two independently owned task queues are sorted by integer priority. Merge them into one sorted queue using the existing nodes. Preserve order inside each input, and prefer the first queue on equal priorities. What happens if the two inputs unexpectedly share a tail? Existing worked reference and changed requirements retained. |
| Tree level order: keep the next frontier separate | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A dependency inspector displays a binary tree one depth at a time, left child before right child. Return one list of values per depth. Equal labels may identify different nodes. How will you avoid mixing children discovered during a level into that same level? Existing worked reference and changed requirements retained. |
| Validate a BST: carry every ancestor constraint | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A storage index exports a binary tree and claims it is a strict binary search tree. Every value in a left subtree must be smaller than its ancestor, and every value in a right subtree larger. Validate that claim. Is checking each node against only its immediate children enough? Existing worked reference and changed requirements retained. |
| Lowest common ancestor: return presence as well as a candidate | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A binary folder tree contains two selected folder objects. Return their deepest common containing folder, allowing a folder to contain itself. Either selection may have been removed from the tree. How will your traversal distinguish “found one folder” from “proved both exist”? Existing worked reference and changed requirements retained. |
| Tree diameter: return one branch, combine two locally | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. A binary network tree needs the maximum number of edges on a simple path between any two nodes. The path may cross the root or stay entirely inside a subtree. What information can one child return that lets its parent evaluate paths crossing the parent? Existing worked reference and changed requirements retained. |
| Dependency order | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “Our build service receives named tasks and prerequisite relationships. It currently Existing worked reference and changed requirements retained. |
| Word ladder | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A word-game editor changes one letter per move. Each intermediate word must be Existing worked reference and changed requirements retained. |
| Connectivity under added links | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A network simulator adds undirected links between numbered machines. After each Existing worked reference and changed requirements retained. |
| Shortest path through a grid | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “Our warehouse viewer marks open cells and shelves. A picker moves one cell Existing worked reference and changed requirements retained. |
| Cheapest route with nonnegative costs | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A delivery planner knows directed road costs. The route with the fewest roads Existing worked reference and changed requirements retained. |
| Top k observations in a stream | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “An operations screen receives integer latency samples indefinitely and displays Existing worked reference and changed requirements retained. |
| Merge k sorted streams | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “We export records from several partitions. Each partition produces ascending Existing worked reference and changed requirements retained. |
| Prefix autocomplete | improved | Linked the actual trie prerequisite separately from backtracking, and reviewed prefix/terminal behavior. |
| Search for unique combinations | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A package builder fills an exact capacity using reusable positive-size blocks. Existing worked reference and changed requirements retained. |
| Find a word without reusing a cell | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A puzzle board contains one character per cell. A word is present if a path of Existing worked reference and changed requirements retained. |
| Minimum coins with a witness | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A kiosk dispenses a requested integer amount using available denominations. Existing worked reference and changed requirements retained. |
| Longest increasing subsequence | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A telemetry analyzer receives ordered integer measurements. It may skip noisy Existing worked reference and changed requirements retained. |
| Edit distance | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A text tool compares a source string with a target. One operation inserts, Existing worked reference and changed requirements retained. |
| Count valid digit decodings | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A legacy format encodes letters as decimal integers 1 through 26, then removes Existing worked reference and changed requirements retained. |
| Days until a warmer temperature | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A weather dashboard shows how many days each observation waits until a strictly Existing worked reference and changed requirements retained. |
| Largest rectangle in a histogram | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A capacity chart has adjacent bars of width one. Find the largest rectangular Existing worked reference and changed requirements retained. |
| Parse and evaluate a policy expression | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “An admin tool stores small policies such as `role == "admin" OR active == TRUE Existing worked reference and changed requirements retained. |
| Maintain an exact streaming median | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A monitoring process receives integer observations and asks for the median after Existing worked reference and changed requirements retained. |
| Advanced coding progression | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. Ordered route to separately specified coding bundles. Existing worked reference and changed requirements retained. |
| Coding foundations · complete practice problems | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. Ordered route to separately specified coding bundles. Existing worked reference and changed requirements retained. |
| Compare coding contracts, return values and complexity | improved | Added an explicit starting example and assignment: Which implementation are you looking at?. |
| Coding problems and trade-offs | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Production applications | improved | Introduced the part through concrete work and prerequisites. Source chapter indexes match the global chapter numbers. |
| APIs and background work | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Follow an HTTP request from validation to durable state | improved | Rewrote around one application journey with concrete wire/state/SQL examples, explained terms, appropriate visuals and a clear local starting point. Removed unsupported universal and time-sensitive claims. |
| Validate provider responses before returning an API result | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Distinguish I/O overlap from parallel CPU execution | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Fetch a bounded batch while preserving order and partial results | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Bounded blocking queue with shutdown | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “Several producer threads submit items to worker threads. Memory must stay bounded: Existing worked reference and changed requirements retained. |
| Bound accepted work and make executor shutdown predictable | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Choose a backend project: tracing, deadlines, fetching, contracts or jobs | improved | Reviewed every linked project route and replaced vague collection/section titles with the actual task. Detailed assignments remain in the linked canonical pages. |
| Data models and transactions | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Model shared data and enforce changes with database constraints | improved | Rewrote around one application journey with concrete wire/state/SQL examples, explained terms, appropriate visuals and a clear local starting point. Removed unsupported universal and time-sensitive claims. |
| Prevent overselling and write skew with the right transaction boundary | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Drive conflicting transactions in two PostgreSQL sessions | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Practice schema design, query plans, concurrent writes and restore | improved | Replaced an older five-project collection with individually grounded workshops, supplied-code entry points, observable outcomes and substantive changed requirements. Removed stale unsupported claims. |
| Frontend state and API integration | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Keep browser drafts, saved data and search results consistent | improved | Concrete application introduction, supplied-code boundary and visible UI/flow. Browser-state lesson rewritten around real screenshots, state trace and source excerpt. |
| Search race · the latest user intent wins | improved | Concrete application introduction, supplied-code boundary and visible UI/flow. Browser-state lesson rewritten around real screenshots, state trace and source excerpt. |
| Full stack · one user action across every boundary | improved | Concrete application introduction, supplied-code boundary and visible UI/flow. Browser-state lesson rewritten around real screenshots, state trace and source excerpt. |
| Bookmark editor · preserve the user's next edit | improved | Concrete application introduction, supplied-code boundary and visible UI/flow. Browser-state lesson rewritten around real screenshots, state trace and source excerpt. |
| Practice visible states, browser ownership, accessibility and form boundaries | improved | Replaced an older five-project collection with individually grounded workshops, supplied-code entry points, observable outcomes and substantive changed requirements. Removed stale unsupported claims. |
| Testing and debugging | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Choose checks that reveal the behavior a change can break | improved | Rewrote around one application journey with concrete wire/state/SQL examples, explained terms, appropriate visuals and a clear local starting point. Removed unsupported universal and time-sensitive claims. |
| Preserve zero when applying a quantity update | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Repair decimal amounts and restart recovery in a transaction importer | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Review three importer patches against data and retry contracts | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Choose an evidence exercise: defects, contracts, load or user journeys | improved | Reviewed every linked project route and replaced vague collection/section titles with the actual task. Detailed assignments remain in the linked canonical pages. |
| Identity and authorization | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Enforce who can act on each resource and what the server can reach | improved | Rewrote around one application journey with concrete wire/state/SQL examples, explained terms, appropriate visuals and a clear local starting point. Removed unsupported universal and time-sensitive claims. |
| Practice authorization, credential recovery and dependency boundaries | improved | Replaced an older five-project collection with individually grounded workshops, supplied-code entry points, observable outcomes and substantive changed requirements. Removed stale unsupported claims. |
| Production operations | improved | Introduced the part through concrete work and prerequisites. Source chapter indexes match the global chapter numbers. |
| System design under constraints | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Design a service from its contract, workload and failure limits | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Draw a bookmark request, then change its failure boundary | improved | Added an explicit starting example and assignment: The application you are drawing. |
| Choose architecture mechanisms from the boundary they enforce | improved | Added an explicit starting example and assignment: Use this as a mechanism reference. |
| Practice workload estimates, architecture choices and recovery plans | improved | Replaced an older five-project collection with individually grounded workshops, supplied-code entry points, observable outcomes and substantive changed requirements. Removed stale unsupported claims. |
| Delivery and controlled rollouts | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Deploy compatible versions and control feature exposure | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Roll out routing configuration without activating unusable backends | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Practice compatible releases, deployment identity and recovery | improved | Replaced an older five-project collection with individually grounded workshops, supplied-code entry points, observable outcomes and substantive changed requirements. Removed stale unsupported claims. |
| AWS infrastructure | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Build once and supply configuration safely at runtime | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| AWS · translate a mechanism into infrastructure | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Use DynamoDB conditions to reject duplicate creates and stale edits | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Upload private object bytes directly and finalize application metadata | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Process duplicate SQS jobs with one conditional DynamoDB result | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Practice reproducible builds, runtime configuration and rollback | improved | Rebuilt the five workshop assignments with concrete application context, a local starting point, measured outcomes, changed requirements and links to worked mechanisms. Removed unsupported absolutes and fixed misleading required outcomes. |
| Production observability | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Use logs, metrics and traces to explain one slow request | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Practice request tracing, diagnosis, metric budgets and sampling | improved | Rebuilt the five workshop assignments with concrete application context, a local starting point, measured outcomes, changed requirements and links to worked mechanisms. Removed unsupported absolutes and fixed misleading required outcomes. |
| Reliability and incident recovery | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Set an error budget and bound retries during overload | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Calculate error budgets, retry amplification and recovery capacity | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Bound retry load and reconcile a lost payment response | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Mitigate an incident, verify recovery and complete the follow-up | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Diagnose stale work after the request-error alert clears | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Practice incident decisions, recovery and completed corrective work | improved | Rebuilt the five workshop assignments with concrete application context, a local starting point, measured outcomes, changed requirements and links to worked mechanisms. Removed unsupported absolutes and fixed misleading required outcomes. |
| System evolution and leadership | improved | Introduced the part through concrete work and prerequisites. Source chapter indexes match the global chapter numbers. |
| Data systems at scale | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Protect shared storage with bounded cache loads and consistent reads | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Trace LRU eviction before implementing its linked order | improved | Added an explicit starting example and assignment: What the cache remembers. |
| Implement LRU without an ordered-map helper | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A preview service caches a fixed number of decoded objects. A successful read Existing worked reference and changed requirements retained. |
| Expiring key-value store | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “A single-process service caches temporary verification results. Each write has Existing worked reference and changed requirements retained. |
| Bound cache misses across instances and preserve fresh reads | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Enforce revocation even when a CDN already has the content | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Count event-time windows with late arrivals | reviewed-retained | Reviewed the opening, contract, prerequisite and example path. “Our event counter receives records out of order. Count events in fixed time Existing worked reference and changed requirements retained. |
| Keep job status current without repeating completed work | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Distribute a hot tenant while preserving event identity and ordering | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Practice cache protection, durable handoff and replica recovery | improved | Rebuilt the five workshop assignments with concrete application context, a local starting point, measured outcomes, changed requirements and links to worked mechanisms. Removed unsupported absolutes and fixed misleading required outcomes. |
| Capacity, performance and cost | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Find the bottleneck and measure cost per useful operation | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Reserve capacity for rollout, zone loss and backlog recovery | improved | Added application context and explicit local/cloud implementation scope. Reviewed the existing workload, worked diagrams, failure outcomes and setup/cleanup guidance. |
| Practice profiling, representative load and unit-cost decisions | improved | Rebuilt the five workshop assignments with concrete application context, a local starting point, measured outcomes, changed requirements and links to worked mechanisms. Removed unsupported absolutes and fixed misleading required outcomes. |
| AI evaluation and guardrails | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Evaluate an AI feature and enforce task-level limits | improved | Application journey, concrete inputs and outputs, explicit task and local versus production scope. |
| Evaluate tag suggestions without hiding rare failures or outage cost | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Build and deploy the AI project workbench | reviewed-retained | Already provides four actual request/response sessions, local versus AWS fixture versus real-model modes, adapter code, template setup and cleanup. Retained this detailed implementation guide. |
| Live migrations | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Migrate live data while preserving writes, deletions and recovery | improved | Follow one bookmark through an out-of-order copy plus descriptive title and application context. |
| Reject stale workers and recover uncertain external effects | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Copy live rows while preserving new writes and deletions | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Move write authority between shards and account for regional data loss | improved | Added concrete application context, an explicit assignment and supplied-code scope before the existing contract and worked mechanisms. |
| Practice compatibility, shadow reads, adoption and retirement | improved | Added an explicit starting example and assignment: The migration these exercises support. |
| Technical decisions and engineering effectiveness | improved | Added a chapter-specific scenario, learning task and starting environment, visible in the website overview. |
| Choose the scope that removes repeated engineering work | improved | Make the repeated incompatibility visible plus descriptive title and application context. |
| Write a design document that supports a decision | improved | Example of a decision a reader can act on plus descriptive title and application context. |
| Turn recurring constraints into a usable technical strategy | improved | Write a rule the next team can use plus descriptive title and application context. |
| Find delivery bottlenecks and reduce dependency on one engineer | improved | Trace elapsed time before choosing an intervention plus descriptive title and application context. |
| Find a chapter, lesson or practice exercise | improved | Aligned source navigation with Part A–D, globally numbered chapters and chapter.lesson addresses. Explained how concepts, labs and briefs differ. |
| Review observed PostgreSQL schedules and transaction reasoning | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Bookmark editor: recorded implementation evidence | improved | Labeled historical evidence and linked the actual application lesson. Preserved dates and scope of the earlier results. |
| Importer assessor key · open after the independent attempt | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Review key: distinguish data corruption, retry policy and useful logging | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Review the incident timeline, alert windows and remaining backlog | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Review cache load, fresh-read and revocation guarantees | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Review the tag-suggestion release decision and cumulative task budget | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Review recovery, migration and ownership under changed assumptions | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Practice · turn understanding into visible evidence | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Assessor · event consumer | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Assessor · private export service | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Assessor · bookmark race schedules | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Assessor · executor cancellation and deadlock | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Assessor · importer diagnosis and review | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Fully scored calibration examples | reviewed-retained | Retained concrete schedules, expected outcomes, causal reasoning and rubric. Candidate material is linked before the held-back answers. |
| Record an attempt with observations and a next practice task | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Consume inventory events without counting replays twice | improved | A fulfillment dashboard tracks changes in item counts. An event e1 adds two books, while e2 removes one. Delivery may repeat e1, but that does not mean two more books arrived. Implement the in-memory consumer described below. This session does not require a database or message broker. |
| Design a private asynchronous export service | improved | A customer wants a downloadable file containing their own saved bookmarks. Building the file can take longer than one HTTP request may wait. Design how the service accepts the request, exposes progress, and later authorizes the download. The session is a design assignment, not a supplied export application. |
| Build a bookmark editor that preserves typing during a save | improved | Alice edits the title of an existing bookmark. A submitted title and the text she is currently typing can differ while a request is pending. Build or repair the browser/API/database path so the successful old response confirms only the submitted value and preserves her newer draft. |
| Implement bounded report execution and shutdown | improved | A reporting service accepts jobs that need a limited downstream resource. Four jobs may run and eight may wait. Callers need to know whether their submission was accepted, and what happens to accepted work when shutdown starts. Implement that in-process contract using the allowed threading primitives. |
| Repair a transaction importer and explain each correction | improved | A finance package downloads pages of transaction records, converts decimal amounts to integer cents, and stores a restart cursor. You inherit a deliberately broken starter. Your assignment is to make narrow repairs supported by observed behavior while preserving identity and progress across restart. |
| Run an unfamiliar coding mock | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Choose harder constraints after a small system works | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Turn a worked lesson into an independent interview practice session | improved | Added a direct exercise entry point and clarified the page’s purpose before its worked material. |
| Build and evolve a shared reading-list application | reviewed-retained | Clear Alice/Bob application, runnable HTTP/SQLite entry point, missing UI/production identity, five dependent stages and explicit local/AWS distinction. Retained. |
| Company interview studio | improved | Added concrete worked-session context, an explicit local assignment, and a revised architecture for the larger follow-up. Corrected stream ordering and descending-cursor examples where needed. Kept company evidence separate from original practice. |
| Databricks · senior backend / product engineering | improved | Added concrete worked-session context, an explicit local assignment, and a revised architecture for the larger follow-up. Corrected stream ordering and descending-cursor examples where needed. Kept company evidence separate from original practice. |
| Meta · senior product engineering | improved | Added concrete worked-session context, an explicit local assignment, and a revised architecture for the larger follow-up. Corrected stream ordering and descending-cursor examples where needed. Kept company evidence separate from original practice. |
| Observe Inc. · senior backend / product engineering | improved | Added concrete worked-session context, an explicit local assignment, and a revised architecture for the larger follow-up. Corrected stream ordering and descending-cursor examples where needed. Kept company evidence separate from original practice. |
| OpenAI · senior product engineering | improved | Added concrete worked-session context, an explicit local assignment, and a revised architecture for the larger follow-up. Corrected stream ordering and descending-cursor examples where needed. Kept company evidence separate from original practice. |
| Reddit · senior product engineering | improved | Added concrete worked-session context, an explicit local assignment, and a revised architecture for the larger follow-up. Corrected stream ordering and descending-cursor examples where needed. Kept company evidence separate from original practice. |