A telephone screening, then I had to do 2 technical rounds, though I was told it should be only one before onsite interviews.

The first round went just fine, and everything was clear. I did all that I was asked for.

For the second round, the first task had a weird requirement (solve without using division). I have never seen such a constraint anywhere in the hundreds of problems I've ever solved. I think it was trying to be innovative, but it off-tracked the interview from technology-thinking to riddle-solving.

For the second task, the interviewer seemed to have no knowledge of C# Dictionary data structures and kept insisting that I should use a set when a dictionary is more efficient in data access. The interviewer's English was unclear, which made it very hard for me to understand him. Most character pronunciations were wrong, causing words to be heard as all vowels.

I even asked a question at the end of the interview after completing the tasks, but I could not understand what he was saying at all. However, I had to give up on it since time was already over.

Q1: Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Input: [4,3,2,1] Output: [6,8,12,24]

Please solve it:

• without division operator
• in O(n).

Q2: Given a short string S and a dictionary D, find out all possible ways to split S using words in D.

Test examples: S = 'abcd' D = ['a', 'b', 'ab', 'cd'] -> ['a b cd', 'ab cd'] S = 'aaa' D = ['a'] -> ['a a a'] S = 'abcd' D = ['ab'] -> [] S = 'abcd' D = ['abcd'] -> ['abcd']