Topic: Divide And Conquer Problem / Level: beginner

Problem: Implement a divide and conquer solution to find the maximum sum of two elements in a rotated sorted array.

Run the code to see the output here...