Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer approach to find the maximum path sum from the top to the bottom of a triangle.

Run the code to see the output here...