mediumOpenAIGoogleAmazon

Simulate an infection spreading across a grid over time

A grid where some cells start infected, and each step every infected cell infects its orthogonal neighbors. How many steps until everything is infected, or -1 if some cell is unreachable? This is rotting oranges in disguise, and the multi-source BFS framing is what they want to hear.

Updated Aug 2026 · Grounded in real Forward Deployed Engineer interview loops and written to a senior-engineer editorial bar.

20 answers per topic instead of 10, plus saved progress and bookmarks · no cardor unlock all 559 remaining answers · ₹2,000 / $25

Every answer, concept and course, every paper breakdown, all published video lessons, hands-on FDE Lab missions, Premium PDF guides and companion files, the full practice-test bank and work-sample downloads. Referral Premium excludes guide PDFs and their companion files.

6 months · One payment · No auto-renewal

Study alongside free video lessons.

Keep practising

Next in this trackTag every part of a generated sentence that came from a source, merging overlaps and listing the sources that contributed.Premium Next in this trackShortest path across a grid to collect every key, where locked doors open only once you hold the matching key.Premium Next in this trackFrom a stream of badge scans, find the employees whose movements are impossible.Premium

FEDITOR'S NOTE

The tell that separates a pass from a stall is recognizing this is multi-source BFS, not a single-source loop run once per seed. Seed every infected cell into the queue at distance 0 and the wavefront expands in lockstep; the last cell dequeued gives the answer, and any cell never reached gives -1.

DISCUSSION · 0

No comments yet — be the first to share your approach.