Fixed

ye thank you for clarification, i was reading it the "wrong way". I've compared the 2 newly filtered and sorted strings against each other and then returned the longest of the 2.

damn... Thank you.

Thank you for the clarification :)

Or replace 'previous' with 'preliminary'.

Too many solutions have passed for SPECS to be changed now.

Input will consist of alphabet characters, both uppercase and lowercase. No spaces.

No symbols.

Thanks for the help @Spindle.

Thanks. That's the culprit. I'll update.

Modified.

Done

Let me confirm.

What edits would you recommend to fix this?

Solutions with duplicates should not pass. Which language?

I think this problem is misrated as well. It requires multiple intermediate built-ins to pass.

I think it should be a 7kyu or a 6kyu.

Rank changes should be allowed even after approval because the approver might give an inappropriate rank.

Given the first paragraph says:

What is an anagram? Well, two words are anagrams of each other if they both contain the same letters.

Then your interpretation isn't possible:

"if" would be an anagram of "fail".

And I think it's the other way around, an anagram tipically uses all the original letters exactly once.