youre close to your given runtime but using arr1.sort() and arr2.sort() at the start ruins it - try arr1.reverse() and arr2.reverse() instead

This entirely defeats the point of the problem, that being to take advantage of the fact that the arrays are already sorted.

Well, you reached 2 kyu, hopes that I can reach it too.

This is contrary to the spirit of the problem.

Good practice is to add spaces between concatenation.

Sets, like dictionaries, cannot contain duplicate values

set() function removes duplicate from the list and also make the list unordered, whileas sorted() will sort the list by numerical order

very helpful

EDIT: apparently nothing, which just makes it more interesting

Try and see.

what happens if you leave out set?

thanks a lot!
1 kyu.....Respects!
i hope i reach there someday:_)

No. Your solution is not O(len(arr1) + len(arr2)).

For faster - O(len(arr1) + len(arr2)) - solution, you could see mine.

Suggestion