Maximum mirrors which can transfer light from bottom to right

A square matrix is given in which each cell represents either a blank or an obstacle. We can place mirrors at blank position. All mirrors will be situated at 45 degree, i.e. they can transfer light from bottom to right if no obstacle is there in their path. 

In this question we need to count how many such mirrors can be placed in square matrix which can transfer light from bottom to right. 

Examples: 

Output for above example is 2.

In above diagram, mirror at (3, 1) and (5, 5) are able
to send light from bottom to right so total possible 
mirror count is 2.

We can solve this problem by checking position of such mirrors in matrix, the mirror which can transfer light from bottom to right will not have any obstacle in their path i.e. 
if a mirror is there at index (i, j) then 
there will be no obstacle at index (k, j) for all k, i < k <= N 
there will be no obstacle at index (i, k) for all k, j < k <= N 
Keeping above two equations in mind, we can find rightmost obstacle at every row in one iteration of given matrix and we can find bottommost obstacle at every column in another iteration of given matrix. After storing these indices in separate array we can check at each index whether it satisfies no obstacle condition or not and then increase the count accordingly. 

Below is implemented solution on above concept which requires O(N^2) time and O(N) extra space.

2

Time complexity: O(n²).
Auxiliary Space: O(n)