Given an integer array and another number, find a pair whose sum is given number. Best solution is to use unordered map <int, int> then use this logic map[sum - a[i]] = a[i]; // O(n) then, for each a[i], if map[a[i]] present then that will be the answer. // O(n)
Write a recursive string parser (in the online test).
Puzzles to check analytical skills
Different ways to write a function in Matlab?
What is a class in C++?
Explain exception handling in C++
Why Mathworks
Many questions regarding maps in C++.
Why C++ is developed after C
Tell me a time when you anticipate a problem and prevent it.
Viewing 5221 - 5230 interview questions