hardxAIPalantirOpenAI

Build a task scheduler: dependencies (topo sort), then priorities, then a concurrency limit

Kahn's algorithm gets you level one. The round is won at level three, where 'run up to K tasks at once' breaks naive topo sort, and the indegree bookkeeping you chose at L1 either saves you or sinks you.

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 548 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 trackBuild a mini spreadsheet: cells hold ints or formulas like =A1+B2, evaluate them and detect cyclesPremium Next in this trackBuild an in-memory database: set/get/delete → field operations and prefix scan → TTL → backup and restore at timestampsPremium Next in this trackBuild an in-memory SQL-like table: schema and select → WHERE → combined && / || clauses → ORDER BYPremium

DISCUSSION · 0

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