Thank you for the explanation! Someone should submit an issue ticket to change the description.

It took me some time to understand the instructions as well.

-For all numbers 1 through n, find all pairs for which the product of those pairs is equal to the sum of all numbers from 1 to n excluding that pair.
-Place each valid pair configuration in its own array.
-The returned group should be sorted by the first element of each array, in ascending order.

You've relaxed the type of permutations to Ord a => [a] -> [[a]], either by saying this yourself or removing the line. However, the random tests do not choose a fixed a, they expect your function to be String -> [String]. Just keep the type and you're good.