Topic: Divide And Conquer Problem / Level: beginner

Problem: Use divide and conquer to solve the problem of finding the maximum sum of a subarray in a rotated unsorted array.

Run the code to see the output here...