Given an M x N grid with obstacles (1) and empty spaces (0), find the number of unique paths from the top-left (0,0) to the bottom-right (M-1, N-1). You can only move down or right.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.