Sponsored
Use these hints if you're stuck. Try solving on your own first.
Use either Dijkstra's, or binary search for the best time T for which you can reach the end if you only step on squares at most T.
Solve with full IDE support and test cases