Problem 778 · Hard
Binary search on time t; BFS to check if destination reachable with cells <= t.
Open the interactive visualisation