Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer approach to find the maximum sum of a contiguous subarray that contains at least one negative number.

Run the code to see the output here...