1 telephonic round. 1 hr round. 3-4 onsite interviews, one whole day.

In the telephonic round, the following questions were asked:

• A puzzle (apple, orange, mix of apple/orange in 3 buckets which were wrongly labeled).
• Some C++ questions.
• One program: you don't have to code, just explain your solution.

HR round

The HR calls from the USA. They will ask about your profile, expectations, current salary, etc. I could not proceed after this round as the salary offered in Mathworks, Bengaluru, is way less. They offer to 11 years of experience what a good engineer can earn in 4-5 years. The HR clearly mentioned that they can't even afford my present salary.

This poor salary offering could be due to the fact that they don't expect Bengaluru to contribute much to their business. I mean, a lot of reviews mention tech support work, etc. I am not sure about this. Do your own research and make your own decision.

Given an integer array and another number, find a pair whose sum is the given number.

The best solution is to use an unordered map <int, int>.

Use this logic:

1. For each element a[i] in the array, store map[sum - a[i]] = a[i]. This step takes O(n) time.
2. Then, for each a[i], check if map[a[i]] is present. If it is, that pair is the answer. This step also takes O(n) time.