A simple, chatty screening to see if you are still interested in the job, followed by a one-hour technical live coding interview.

The interview questions were beginner level, but the coding exercise was quite advanced.

It was a single pass/fail question. I actually thought this required more advanced knowledge than the senior-level interviews I've had.

Given two strings of words, create an algorithm to return all words that occur in only one of the two strings. A word can appear many times in one string and still qualify, as long as it's not present in the other.

Using nested for loops is inefficient. Can you achieve this more efficiently than the native String.indexOf() method, without using nested for loops or recursion?