Topic: Divide And Conquer Problem / Level: advanced

Problem: Implement a divide and conquer solution to find the "Maximum Product of Two Non-Adjacent Elements" in an array.

Run the code to see the output here...