Your question is Unique Paths With Obstacles. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
What is the most efficient way to calculate the number of unique paths to reach the bottom-right corner of a matrix with obstacles?