Topic: Array Problem / Level: intermediate

Problem: Find the minimum number of adjacent swaps required to turn an array into a palindrome.

Run the code to see the output here...