I had 2 phone interviews which I was told I did very well. I have plenty of experience in phone sales. At my face to face, the manager had the nerve (stupidity) to ask me, "Where do you see yourself in 5 years, retired and tending your garden?" They didn't realize from my resume (as I only go back 7 years) how old I was when they spoke to me on the phone.
Find the optimal map route between two points on a grid (maze) with some areas blocked out.
Given a large unsorted text file containing thousands of words count the number of times each word appears.
consider one situation, 9,9,9,9 to 1,0,0,0,0.
Why Pepsi
count the number of letter combination in a short message.
1. How to achieve automatic type conversion from type X to type Y? a. X can define the member function operator Y() b. a) or b) can be used c. Y can define the constructor Y(const X&) d. none of the above 2. class Coordinate{ int x; int y; public: Coordinate(int a=0, int b=0) { x=a; y=b; }; }; What are the values for the following object: Coordinate point(10); a. x=10,y=0 b. x=0,y=10 c. x=10,y=10 d. x=0,y=0 3. What type of argument can the following function take : Void foo(); a. any number or type of arguments b. a character c. an integer d. no an integer argument of any type 4. Consider the following function declarations in a header file: void doit(char *, int); int doit(char *) ; float doit(float, float) ; Which of the following declarations cannot follow in the same header: a. void doit(int, char *); b. int doit(int) ; c. float doit(char *) ; d. int doit(int, int) ;
Write a function that detects the first non-repeating character in a char array, and do so with only a single pass over the array.
1. Cumulative sum of fibonacci series. fib(n) = addition of all the fibonacci numbers upto n -1.
Was asked to implement a method to find the middle value of a linked list with using the standard provided functions of a linked list Also asked to find a number repeated sequentially the most number of times in an integer array. Then provide test cases on function
Viewing 461 - 470 interview questions