Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer approach to find the longest common prefix among an array of strings.

Run the code to see the output here...