Leetcode 3276. Select Cells in Grid With Maximum Score

Choose at most one cell from each row so that all selected cell values are distinct, maximizing the sum of the chosen values. This is a max-weight selection/assignment problem under a uniqueness constraint across rows (small grid sizes allow DP/bitmask or matching-style solutions).