same issue

Difficulty is decided by the community in general, though there may be some outliers in terms of rankings rarely from time to time, this one is correctly ranked !

The user seems to be not active anymore.

Also, this is an optimization task, and obviously a naive solution won't pass the tests.

If at first you don't succeed, think about the Math. If at second you don't succeed try another Kata, he literally has made almost a thousand of them.

If you always got timeout, please optimize your algorithm ;-)

As in many of myjinxin2015's katas, the key is to find out what the solution should be like so you're not actually bruteforcing the answer. Usually looking at the test cases will tell you if you need to avoid bruteforcing.

I'm using my eye to find the different ;-)
first different: A[5] is 383, B[5] is 822
second different: A[7] is 310, B[5] is 479
third different:....
Now I can say it should return false, because description said:

Two arrays are called similar if one can be obtained from another by swapping at most one pair of elements.

You Don't need to sort the Array, I think ;-)