I got question from google phone screen last month.

You are given two source and two destination in coordinate.
Also, you would be given the rows and columns number in this coordinate.
There are some obstacles in the coordinate.
Return the two source could go to the two destination or not.

The best solution would be O(R*C) using topological idea.
Does anyone know similar question in leetcode?
I still can't propose the solution.