Something like this:
int[] a = {3, 2147483646};
int[] b = {9, 4};
returns true...

Could you elaborate?

Can you give an example? If any a[i]*a[i] overflows, then there can be no matching b[j]. I suppose b[j] could exactly match the overflow value of a[i]*a[i], but that is a little tricky for 6kyu.

yes. More than one continuous spaces splited by " " will got the empty string, joined by " " will revert it.

Any prime close to max value of int will cause this solution to timeout.

This solution will not work properly in case of int overflow.

I am disappointed with this website ... it teaches to write inefficient and incorrect code

• returning negative number instead of zero is WRONG
• int can overflow to positive value as well

This solution is too slow anyway (if we are talking about performance) to bother about such minor optimization at all.

Will this solution still work for tests where words are separated by more than one space?