Topic: Divide And Conquer Problem / Level: advanced

Problem: Implement a divide and conquer approach to find the "Minimum Cost Path" in a weighted grid.

Run the code to see the output here...