Given a matrix of '.' and '#' where '#' denotes the obstacle in the matrix. Find the longest path starting from first row (any cell) of matrix to last row (any cell) of matrix.
You can travel left, right and bottom from a particular cell
Eg:
[['.', '.']
['.', '.']]
Ans = 4
Any ideas how to approach this ?