• You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (ie. entry/exit points are unidirectional doors like valves). The cells are named with an integer value from 0 to N-1. You need to find the the length of the largest cycle in the maze. Return -1 if there are no cycles. • You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (ie. entry/exit points are unidirectional doors like valves). The cells are named with an integer value from 0 to N-1.
Development Engineer Interview Questions
37,098 development engineer interview questions shared by candidates
Programming
Can Si be used to make LEDs ?
Estimate the number of flat tyres in the US in a year?
consider one situation, 9,9,9,9 to 1,0,0,0,0.
Find the optimal map route between two points on a grid (maze) with some areas blocked out.
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) ;
1. Cumulative sum of fibonacci series. fib(n) = addition of all the fibonacci numbers upto n -1.
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.
Viewing 321 - 330 interview questions