Domanda di colloquio di Scott Logic

2nd Round, Write a function to check if 2 string's are Anagram.

Risposta di colloquio

Anonimo

8 dic 2022

I used the sort and then compare, they asked me about the Big(O) of Sorting..It's nLogn.. and he asked if I could figure out any other quicker solution I used Map and tried to do it in single loop, the interviewer was quite supportive in guiding me.