The phone interview is pretty easy. The on-site one is more technical and they did ask some concept that I did not know of.
Financial Software Developer Interview Questions
757 financial software developer interview questions shared by candidates
What is the difference between stack and heap memory
Given a stream of integers, how do you find the median of the numbers? Follow Up: Consider the functionality for a corp., to find the median of company, what is the most time effective way of doing it? Now, if having similar functionalities such as average, min, max, variance, etc. what data structures would you use?
It was a brainteaser with monks.
write a function to compare 2 strings of the same length, find the number of different chars. e.g. myCompare('bond','debt') = 2 myCompare('xxxx','yyyy') = 2 the 2 input parameters are const
read the following code and tell me the output, and is there anything wrong about it? #include <iostream> class A { public: A() { foo(); } virtual void foo(int a = 10) { std::cout << "A = " << a << std::endl; } }; class B : public A { public: B() { foo(); } virtual void foo(int b = 20) { std::cout << "B = " << b << std::endl; } }; int main() { A* aPtr = new B(); aPtr->foo(); delete aPtr; return 0; }
Given an input of stream of words find the most recurring word. what is the data structure used for this purpose. what will be the time complexity of that.
Improve on the previous code, then give the running time on the two codes and explain which would be better to use if you were a manager and presented with these two codes and why
Insert sort & complexity? binary tree & Depth First Search? reverse number?Classic questions.
Algorithm test, how to represent in flow chart a certain game or a certain aglorithm
Viewing 161 - 170 interview questions