You're right the instructions are unclear due to extra verbosity (and a not-normal use of 'same', math specific maybe?), but what you have provided isn't the same as what the kata asks.

"Create a function that takes two arrays of integers, comp(a, b) [compSame(a, b) in Clojure], and checks if the values in array b are the squares of the values in array 'a' such that there is one value in 'b' for each value in 'a' and no unpaired values. Please be careful since this function can also accept null values for parameters, and negative numbers also have sqares."

This is what it should be, though some of the syntax stuff at the end of the original prompt still applies. The original, while highly specific, really doesn't do the best job of explaining the challenge.

indeed ! WTF.

Hahaha

The pop will return the last element, and if the element does not exists, they will return this element...

Perfect solution, and very different from mine!

what does -> do?
where is row declared in valid9?
can someone explain the code please?

couldn't you avoid the "series whose unique numbers add up to 45 but are not valid sudoku wins. For example 2, 2, 9, 9, 6, 1, 8, 14, 5 or 0, 0, 0, 0, 0, 0, 0, 45. " by doing row.uniq.size == 9

I'm wondering this as well. When there's one name how come the output is not " & Bart"?
I see it works but I'm having trouble understanding why the "&" is not returned since it's hardcoded into the string.