time `t == 4`, move from room `(1, 2)` to room `(1, 3)` in two seconds.

Example 3:

 
Input: moveTime = [[0,1],[1,2]]
 
Output: 4

Constraints:

Solution

The problem requires finding the minimum time to reach the bottom-right corner of a grid, while adhering to certain rules:

Alternating movement cost: Moving between adjacent rooms alternates between 1 second and