← Amazon questions

Maximum non-attacking knights on an NxN chessboard

Filed under Amazon

Determine the maximum number of knights that can be placed on an N by N chessboard such that no two knights attack each other.

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 Amazon questions

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