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)
Basics, told to write syntax, even after explaining stuff was rejected
Array, Sliding window array, matrix, dynamic programming, backtracking etc.
STAR behavior questions. Design banking system.
Behavioral Questions and Questions about Resume
What are your weaknesses
Secure wcf apps
Have you worked on rest apis
They asked me about my expectations about the current package.
what are lifecycle methods in react
Viewing 7631 - 7640 interview questions