Application Support Lead Interview Questions

10,326 application support lead interview questions shared by candidates

Third round. 1. To write C++ code to sort array, or something very similar 2. Two puzzles - Fox and duck puzzle - one is in the middle of a circle and the other cant enter this circle. What is the best path for the animal in the middle to escape? Some square cutting puzzle - I don't remember this, but I suggest going through puzzles in Indiabix or crazyforcode
avatar

Applications Developer

Interviewed at Oracle

3.5
Dec 8, 2017

Third round. 1. To write C++ code to sort array, or something very similar 2. Two puzzles - Fox and duck puzzle - one is in the middle of a circle and the other cant enter this circle. What is the best path for the animal in the middle to escape? Some square cutting puzzle - I don't remember this, but I suggest going through puzzles in Indiabix or crazyforcode

Puzzle: There is a worker, working for 7 days. You have a long piece of gold, of which you give 1/7th of the piece to the worker daily. Find the minimum number of cuts required to make in the gold piece, such that the worker gets his fair share each day.
avatar

Applications Engineer

Interviewed at Oracle

3.5
Jan 11, 2018

Puzzle: There is a worker, working for 7 days. You have a long piece of gold, of which you give 1/7th of the piece to the worker daily. Find the minimum number of cuts required to make in the gold piece, such that the worker gets his fair share each day.

There is a bank, containing ‘c’ counters. There are ‘n’ people standing in a queue. The counters open at 9:00 A.M. There is also an array a[n] given, containing the time taken by every person to coomplete his/her query at the counter. Whenever one counter gets empty, the very next person in the queue goes to that particular empty counter. Find at what time the x’th person (x <= n) will have his/her turn and at which counter. A fully working code was expected, considering all the base cases and exceptions, with proper syntax. (Written Code)
avatar

Applications Engineer

Interviewed at Oracle

3.5
Jan 11, 2018

There is a bank, containing ‘c’ counters. There are ‘n’ people standing in a queue. The counters open at 9:00 A.M. There is also an array a[n] given, containing the time taken by every person to coomplete his/her query at the counter. Whenever one counter gets empty, the very next person in the queue goes to that particular empty counter. Find at what time the x’th person (x <= n) will have his/her turn and at which counter. A fully working code was expected, considering all the base cases and exceptions, with proper syntax. (Written Code)

Viewing 9681 - 9690 interview questions

Glassdoor has 10,326 interview questions and reports from Application support lead interviews. Prepare for your interview. Get hired. Love your job.