System Engineer

I simply used hashing to solve this problem by checking the frequency of characters in both strings.

I asked for some clarifications whether I should print all distinct x‘s or if I should print an x if a pair of +x and -x is encountered. The first approach I told was to use a map and I was keeping a flag for +x and -x if it’s found once. Later he asked me to print all pairs, so I stored the frequencies of all the elements in the map and iterated through the negative elements and for each element x , I would print x min(count[-x],count[+x]) times. He said he can’t afford that much space and he wanted me to optimise space further. So I told him a 2 pointer approach where I sort the array once and then keep two pointers to the start and end. I would move the start pointer forward if the sum is less than 0 and I’ll move the end pointer backward if the sum is greater than 0. He was fine with the solution and asked me to code it in a paper. I wrote the code and walked him through it.

Answering this question requires skill and ingenuity. With this question, you will be able to acknowledge weaknesses that you look forward to improving. Public speaking, time management, self-criticism, etc., are some common areas of weakness that will not negatively reflect on your selection. The tone should be positive. Always speak only of true forces and never state strengths that you cannot verify. Avoid saying anything that could adversely affect your selection.