Skip to main content
All Questions

Each square of a chessboard holds a non-negative integer. Place two rooks that do not attack each other so that the sum of the two squares they occupy is as large as possible.

Unlock detailed company stats for this questionUpgrade

Community answers

No answers contributed by the community yet.

Related questions

What is the largest number of knights that can be placed on a 64 x 64 chessboard so that no two knights attack each other?

Related courses

Course

Behavioral Interviews: A Practical Guide for Engineers

Get offers at the level you deserve. Prep for senior+ behavioral interviews at FAANG and Tier-1 companies. Made with staff and principal engineers from Meta, Netflix, Google, and more. Avoid downleveling, elevate past projects, and stop sounding like a robot.

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.