Topic: Divide And Conquer Problem / Level: advanced

Problem: Implement a divide and conquer algorithm to find the "Maximum Subarray Product" using dynamic programming techniques.

Run the code to see the output here...