Given an N x N matrix with 0 (open path), 1 (diamond), and -1 (blocked). Start from (0,0) and reach (N-1, N-1) moving only right and down, then return from (N-1, N-1) to (0,0) moving only left and up…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.