Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer algorithm to find the longest alternating subsequence in an array.

Run the code to see the output here...