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).
What is strategy pattern? And where do you use it.
Very specific details about minutia in my resume
Desired salary English questions related to my professional experience
Preguntas situacionales. De conocimiento sobre el lenguaje por el cual te entrevistan.
Problem solving, advanced C++
anagrams implementation, normal C++ coding questions, write some kind of date and payments manipulation program
General technical questions, DDD, C#, performance and optimization, etc..
Questions related to the coding assignment
Viewing 251 - 260 interview questions