Given a grid of size N x 3 which contains numbers ranging from -10^6 to +10^6 and we have K 2 x 1 tiles. We are allowed to place a 2 x 1 tile on the grid (horizontally or vertically) and collect the sum of the numbers beneath the tile. We cannot overlap the tiles. Output the maximum sum we can collect using at max K tiles.

Can someone share the approach to this question?