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
Some questions on algorithms, performance, and statistics.
Problem solving, advanced C++
Regular technical questions during the online coding sessions. Reasons for the application. Questions about career and expectations.
Operator Overloading question
Preguntas situacionales. De conocimiento sobre el lenguaje por el cual te entrevistan.
Desired salary English questions related to my professional experience
Viewing 361 - 370 interview questions