Your question is Anagram Check and Complexity. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
How do you check if two strings are anagrams of each other? Explain your approach and the runtime complexity.