awesome-everything RU
↑ Back to the climb

Frontend Architecture

Data fetching: free-recall review

Crux Free-recall prompts across the data-fetching unit. Answer each in your own words first, then reveal the model answer and compare.
Your altitude — climbing toward senior
ZeroJuniorMiddleSenior
You are at senior altitude — in orbit
◷ 13 min

Retrieval beats re-reading. For each prompt, say or write a full answer from memory before you open the model answer — the effort of recall is what makes the unit’s mental model stick.

Goal

Reconstruct the unit’s spine — why fetch location decides LCP, how waterfalls form and dissolve, what RSC streaming and the SWR cache each buy, and how multi-layer invalidation works — without looking back at the lessons.

Recall before you leave
  1. 01
    Why does the location of a data fetch decide LCP more than network speed?
  2. 02
    Why do component-level useEffect fetches form a waterfall even when the data is independent, and what three patterns dissolve it?
  3. 03
    What is the 'use client' boundary rule, and what does marking everything 'use client' cost?
  4. 04
    Explain stale-while-revalidate and single-flight deduplication in TanStack Query / SWR.
  5. 05
    What is the canonical optimistic-update pattern, and what is the classic bug?
  6. 06
    Name the cache layers in a Next.js 15 app and why a mutation must invalidate more than one.
Recap

If you could reconstruct each answer from memory, you hold the unit’s spine: fetch location sets the round-trip count on the critical path and therefore LCP; the render cascade serialises independent fetches into waterfalls that Promise.all, useQueries, or sibling RSC components dissolve; Server Components ship zero JS only when they stay server-side, and Suspense streaming buys a low TTFB; the client cache makes revisits instant via stale-while-revalidate and single-flight, with optimistic updates demanding a full snapshot; and every mutation must invalidate every cache layer it touches — server revalidation alone is not enough.

Continue the climb ↑Data fetching: code reading
shortcuts expand
search
K
prev piece
k
next piece
j
cycle tier
t
this menu
?
sources3
expand
  1. 01
  2. 02
  3. 03

Trademarks belong to their respective owners. Editorial reference only.