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)
Different ways to write a function in Matlab?
What is a class in C++?
Explain exception handling in C++
Write a recursive string parser (in the online test).
Why would you want to work with MathWorks
Puzzles to check analytical skills
why did you choose structural engineering
what is destructor ,CharAt(),Memoryleaked,Dispose(), write a program to swap without sing temp variable, program to find duplicate in a string and return bool if it has duplicate. Be prepared with memory management topic and string programs
Strings in Java
Viewing 5211 - 5220 interview questions