Topic: Divide And Conquer Problem / Level: intermediate

Problem: Write a divide and conquer algorithm to find the maximum sum of non-contiguous subarrays in an array.

Run the code to see the output here...