Leetcode 3257. Maximum Value Sum by Placing Three Rooks II

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3257. Maximum Value Sum by Placing Three Rooks II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact