Algorithm · Databricks · Medium
You are navigating a simplified street grid of San Francisco on your way to work. The map is a 2D grid where each cell holds a character meaning: 'S': your home (the starting cell). 'D': your office (the destination cell). A digit from '1' through k: a city block served by exactly one transportation option. 'X': a blocked area you cannot enter. You are supplied with three arrays, each of length k: modes: the display name of each transport option. times: the number of minutes…
Checking your access…