3938. Maximum Path Intersection Sum in a Grid

You are given an m x n integer matrix grid. Two players move across the grid: - Player 1 starts at the top-left cell (0, 0) and can move only right or down. Their destination is the bottom-right cell (m - 1, n - 1). - Player 2 starts at the bottom-left cell (m - 1, 0) and can move only right or up. Their destination is the top-right cell (0, n - 1). Each player must choose a valid path from th