Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to solve the problem of counting the number of unique paths from the top-left corner to the bottom-right of a grid.

Run the code to see the output here...