Position: L3 at Google India\nYOE : 1.4 years\n\nOnsite-1: You are given a 2D matrix which has some cells blocked. Find the minimum number of cells to be blocked so that you can\'t reach the end i.e (m-1,n-1) from 0,0. You can go only towards right and bottom.\nFollow Up: You can go in all 4 directions.\n\nCan someone please provide the solution for both the questions(initial and follow up)?\n

Position: L3 at Google India\nYOE : 1.4 years\n\nOnsite-1: You are given a 2D matrix which has some cells blocked. Find the minimum number of cells to be blocke