You are given a 2D grid containing three types of characters: 'W' (wall), 'D' (door), and 'E' (empty cell). Fill each empty cell with its shortest distance to any door. If an empty cell cannot reach…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.