There is an $m \times n$ grid where a robot starts at the coordinates startPos $= [\text{start}_{\text{row}}, \text{start}_{\text{col}}]$ and aims to travel to its destination at homePos $= [\text{home}_{\text{row}}, \text{home}_{\text{col}}]$.

At each step, the robot can move one cell up, down, left, or right. The cost of each movement depends only on the target cell:

• Moving into any cell in row $r$ costs rowCosts[r].

• Moving into any cell in column $c$ costs colCosts[c].

The robot does not pay any cost for its starting cell.

Return the minimum total cost for the robot to move from startPos to homePos.

Constraints:

• m $==$ rowCosts.length

• n $==$ colCosts.length

• $1 \leq m, n \leq 10^5$

• $0 \leq$ rowCosts[r], colCosts[c] $\leq 10^4$

• startPos.length $== 2$

• homePos.length $== 2$

• $0 \leq \text{start}_{\text{row}}, \text{home}_{\text{row}} < m$

• $0 \leq \text{start}_{\text{col}}, \text{home}_{\text{col}} < n$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.