Search
⌘K
Get Premium
Leetcode 3256. Maximum Value Sum by Placing Three Rooks I
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.