Topic: Divide And Conquer Problem / Level: advanced

Problem: Write a divide and conquer solution to solve the "Maximum Subarray Product" in an array.

Run the code to see the output here...