Train the way you actually interview.
Three surfaces, three kinds of thinking. One asks you to write the code, one asks you to read it, one asks you to see it land on screen. Pick the gap you want to close.
Frontend interview · senior
Ten FAANG-style problems with a coach that pushes back. Sandboxed Web Worker, real test runs, three hints per problem.
Time complexity · drill
Read a snippet, pick its Big-O. The reverse direction of live coding — train your eye on the access patterns that drive runtime.
Calendar UI · React + CSS
Six calendar views built with JSX and CSS, from a 7-column month grid to a year heatmap. Live iframe with React + Babel, structural assertions, reference solution one keypress away.
DS&A · Round 1 foundations (array + hash-map)
Start here. The Round-1 core: two questions, ~30 min each on HackerRank — Q1 a straightforward array, Q2 a medium hash-map. Agoda scores understanding, efficiency, performance, testing, communication — so write tests and narrate out loud.
DS&A · Round 1 patterns (graphs, trees & DP)
Agoda names graphs and dynamic programming as Round-1 topics, so these are in scope. Ten problems through a 7-phase Socratic loop — clarification, approach, complexity, edges, code, tradeoff. No clock; learn the shapes here, then drill timed.
DS&A · timed mock (medium, blind)
Nine fresh mediums, never seen in the other sets. Solve blind against the 30-minute clock, narrate out loud, no peeking. Two back-to-back mirrors the real 60-minute round.
LeetCode · Top Interview 150
The canonical FAANG list — 150 problems across 23 topics, each linking out to LeetCode with its optimal Big-O colour-coded. Your volume engine: grind here, tick them off, then drill the weak patterns on the coached sets.
Blind 75
Krishnadev's classic 75 — the tightest high-yield set across array, string, DP, graph, tree, interval and more. One link per problem with its optimal Big-O. Solving a problem ticks it here and in Top 150.