Given an m x n grid of characters where 'S' is the source, 'D' is the destination, '0' is an open path, and '1' is an obstacle, find the length of the shortest path from 'S' to 'D'. Return -1 if no…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.