Meeting train carriages puzzle
Filed under Goldman Sachs
The question
Devise a uniform algorithm that runs on two identical train carriages located at separate positions on an infinite track so that they meet each other.
No write-up yet. Related questions below have one.
Related Goldman Sachs questions
Collected from public candidate posts and coding forums. Updated Nov 2026.