mediumPalantir

You're handed docs for an API you've never seen: use it to find the shortest path between two nodes

Palantir's signature coding genre isn't an algorithm; it's working from unfamiliar documentation: a graph API, a custom serialization spec, a mini query language. The behaviors graders score, plus the BFS-over-an-opaque-client worked example.

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 trackGiven a file-system hierarchy and timestamped permission changes, can user X access file F at time T?Premium Next in this trackThe C3.ai screen pair: Trapping Rain Water and Daily TemperaturesPremium Next in this trackBuild a rules engine: evaluate boolean expressions like `age > 18 and country in ["US","CA"]` over a recordPremium

DISCUSSION · 0

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