Get peace and money

Total there are five Technical Interviews followed by Management round. So here are the questions. Google Interview Round 1 :: 1. What is the Space complexity of quick sort algorithm? how do find it? 2. What are dangling pointers? 3. Given that you can take one step or two steps forward from a given step. So find the total number of ways of reaching Nth step. 4. You are given biased coin. Find unbiased decision out of it? 5. On a empty chessboard, a horse starts from a point( say location x,y) and it starts moving randomly, but once it moves out of board, it cant come inside. So what is the total probability that it stays within the board after N steps. Google Interview Round 2 :: 1. You have 1 to N-1 array and 1 to N numbers, and one number is missing, you need to find the missing the number. Now you have 1 to N-2 numbers, and two numbers missing. Find them. 2. You have cycle in linked list. Find it. Prove that time complexity is linear. Also find the node at whic

Yahoo Telephonic Round: Design classes for the following problem. (C++) A Customer Can have multiple bank accounts A Bank account can be owned by multiple customers When customer logs in he sees list of account, on clicking on an account he sees list of transactions. Yahoo Interview Round 1: 1. How to call a C++ function which is compiled with C++ compiler in C code? 2. When you deliver your C++ headers and C++ library of a class (what all can you change in the class so that application using your class does not need to recompile the code) 3. How do you initialize a static member of a class with return value of some function? 4. How can one application use same API provided by different vendors at the same time? 5. If you are given the name of the function at run time how will you invoke the function? Yahoo Interview Round 2: