I've had uber phone screen recently.

Given a NxN Matrix with each index is a character of either forward/backward slash. Find number of paths from top left to bottom right?

Input:
[['/', '\', '/'],
['\', '/', '\'],
['/', '\', '/']]

Can consider edges are connected.