I think O(n log n) is the fastest and best way, because O(n log n) is the fastest way to check if the word is a isogram and O(n) can’t check if the word is a isogram.
EDIT: I was wrong, you CAN check with O(n) if the word is a isogram. I watched the rest of the video and I fully understand it.