Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to find the maximum sum of a contiguous subarray with at least one negative number.

Run the code to see the output here...