Available question text
Pick three cells on an m×n integer board so that no two share a row or column and the sum of their values is maximized — equivalently, find the maximum-weight partial matching of size 3 between rows and columns. With m,n up to 500, brute-force triples is infeasible, so the challenge is to derive an O(mn · polylog) / optimized precomputation or DP approach.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Value Sum by Placing Three Rooks I
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 3257. Maximum Value Sum by Placing Three Rooks II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source