The instructions are as follows.
"Take 2 strings s1 and s2 including only letters from a to z. Return a new sorted string, the longest possible, containing distinct letters - each taken only once - coming from s1 or s2."

A non-latin alphabet isn't specified in the instructions and wouldn't be included in this use case.

Nope, due to amount of solves

Would be nice if the instructions had a link to the code golf version!

right, I always forget what's the correct version.

thx for the approval ;)

approved

@b4b: You have to wait a week if the author is active, not if they're inactive.

Last Seen: Dec 2019

and it's february now, so it is approvable. I'll take a look.

done, but you'll have to wait for a week before a PU can approve it (myjinxin isn't active anymore)

python translation, please review and approve

Would it be possible to have a Python translation?

I would suggest for the tests to use "exotic" letters, such as à, é, ... or may be some in non latin alphabets?

This wouldn't work if the strings use a non latin alphabet.