City Road Network Graph – Distance/Shortest Path

Tech Deep DivePalantirLast reported May 2026Medium Frequency
Reported
4× across candidate reports
First seen
May 2025
Last reported
May 2026
Reported outcome
mixed

Problem Overview

You are given code that builds a graph representing a city road network using several classes: Location (holds city name), Road (holds from/to Location and a distance/weight), RoadConnection (holds destination Location and distance), and a RoadNetwork class. The existing code constructs the graph by adding roads as unidirectional (one-way) edges,…

  • 4 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Palantir catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Palantir question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?