Available question text
Select three cells on an m×n board (rooks cannot attack, so all three must have distinct rows and columns) to maximize the sum of their values. Equivalently, compute the maximum-weight matching of size three between rows and columns (m,n ≤ 100, values can be negative).
Related questions
Continue with questions that share topics or the same question type.
- Maximum Value Sum by Placing Three Rooks II
Coding
- Average Value of Even Numbers That Are Divisible by Three
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Check if Number is a Sum of Powers of Three
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3256. Maximum Value Sum by Placing Three Rooks I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source