← Google questions
CodingReported in a candidate post, May 2025

Shortest path in teleporter network with broken nodes

Filed under Google

Given a directed graph of N teleporter nodes, a start node A, and an end node B. Working teleporters take 0 days to use, while partially repaired teleporters take 1 day. Find the minimum number of…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.