Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer approach to find the number of unique paths in a grid with obstacles.

Run the code to see the output here...