Topic: Divide And Conquer Problem / Level: advanced

Problem: Write a divide and conquer solution to find the "Maximum Sum of K Non-Overlapping Intervals".

Run the code to see the output here...