← Goldman Sachs questions

Knight tour problem

Filed under Goldman Sachs · Also reported at Medlife

Given a chessboard of size N x N, find the minimum number of steps a knight needs to take to reach a specified target position from a starting position.

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 Goldman Sachs questions

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