Leetcode 3341. Find Minimum Time to Reach Last Room I

Given an n×m grid where each cell has the earliest time it can be entered and moving to an adjacent cell takes exactly 1 second (you may need to wait in a cell until the neighbor opens), compute the minimum time to reach the bottom-right cell from (0,0). This is a time-dependent shortest-path problem on a grid (solveable with Dijkstra/BFS using a priority queue, accounting for required wait times at neighbors).