Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to solve the problem of counting the number of distinct elements in a rotated sorted array.

Run the code to see the output here...