Maximum sum placing two non-attacking rooks
Filed under American Express
The question
Given a 2D list of integers representing a chessboard, return the maximum sum attainable by placing two rooks on the board such that they cannot attack each other (same row or column).
No write-up yet. Related questions below have one.
Related American Express questions
Collected from public candidate posts and coding forums. Updated Nov 2026.