Given an m x n grid where each cell either contains an empty space (0) or an obstacle (1), and a maximum number of obstacles you can eliminate (k), return the length of the shortest path from the…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.