Problem 3342 · Medium

Find Minimum Time to Reach Last Room II

Dijkstra over (room, next-move cost) states, where each move alternates between one and two seconds.

Open the interactive visualisation