# 17K

Applications Specialist interview questions shared by candidates

## Top Interview Questions

Sort: Relevance|Popular|Date
Senior Applications Developer was asked...February 14, 2011

### We have a pond containing a single bacterium. The number of bacteria double every 5 minutes, and the pond is full of them in 24 hours. If we started with the same pond but two bacteria, how long will it take to fill the pond?

I struggled with this a bit and got close. I believe answer is: 23:55

The first pond started with 1 bacterium and doubled to 2 in five minutes. Therefore, the second pond will take 5 minutes less than the first to be full. ie: 23:55 Less

This is a clear case of Geometric progression. Find the nth term Tn1 = a*r^(n-1). where n = (24 * 60)/5,a = 1 and r=2. when the initial value (a) = 2, the values become n = ?, a = 2 and r = 2. Since Tn1 = Tn2, Equate the RHS of both the equation. Since the base are equal, equate the powers, doing so will give the n value. When n is convert into minutes one get 23 hrs 55 minutes. Less

### If a 3x3 white cube is painted blue on its face and then cut into 1x1 cube, what are the chances of picking a cube with a blue side from a bag

From a 3x3x3 Cube you can make 27 1x1x1 cubes, Since one face of the cube is painted blue. once face of 9 1x1 cubes will be blue. hence the answer is 9/27 = 1/3 = 33% Less

Is it 6/27? why is 9?

P= 1/3, or 33%

### Why are you a good fit for this role? How do you work in a team? Give an example How do you handle multiple deadlines? What is your GPA and when are you graduating? What is your Visa status and would you need sponsorship at anytime? When would you be able to start the job?

Hi, How long did it take for them to get back with results of the first round?

Hi, How long did it take for them to get back with results of the first round?

Oh... it still says interview process for me... i gave the video round last week, I guess I'll have to wait some more time... thanks for the reply Less

When ever I get a work I never leave that work in between before completing it. This is one of my weakness. Less

i lose my temper quickly

go to their official sites..

### Basic HR questions in the Video Interview. 1. Why does this position interest you? 2. What about you experience makes you fit for this position? 3. Give an example how you tackled multiple responsibilities? 4. GPA 5 . Visa status

I have the same question. It would be really helpful if you can provide us with the info. Less

It took 4 business days for me.

I got rejected after the video round. No reason. totally let down!

### You have 20 balls all equal in size. They all weigh the same except for one. How do you identify the one that weighs less or more?

If we can do as many times as we want, just random pick 2 balls. If they have equal weight, compare with the rest. If not, just pick the third one to find out which One is the exception. Less

• Break the balls into the following groups: (1, 2, 3), (4, 5, 6), (7, 8) • Step 1. Weigh (1, 2, 3) against (4, 5, 6) Two possible outcomes: The two groups are equally heavy. (Case A) One of these groups is heavier than the other. (Case B) • Case A &gt;&gt; Weigh 7 against 8. Now you have identified the heavier ball in 2 weighing. • Case B &gt;&gt; Take the heavier group (assume it to be (1, 2, 3)), take any two balls and weigh them against each other. Either one of these is heavier else the third ball is. Less

The above answers is for 8 balls.

### Take a number like 1234 Write a code to get the next number using the same set of numbers used in 1234. Like 1234 and the next number must be 1243 and so on

void permute(char *a, int l, int r) { int i; if (l == r) printf("%s\n", a); else { for (i = l; i &lt;= r; i++) { swap((a+l), (a+i)); permute(a, l+1, r); swap((a+l), (a+i)); //backtrack } } } int a[]={1,2,3,4,5} permute(a,0,5); Less

Find all the permutations of the number (use recursion technique to find permutation) and make sure the output is sorted. I used a TreeSet so that I neither have duplicate values and also the output is sorted Less

Consider numbers 1, 2, 3 and 4. Store these values in array. Consider the number as 1432. Now find the next number and it should be 2134. Iterate the array from reverse order. (compare 2 with all the number in sequence 3,4 and 1) Find the digit value which is lesser than last digit. In this case 1 is lesser than the last digit 2. So the index is 0. Interchange the numbers. It will become 2431. Now sort array. start index is index+1 and end is size of array. So sorting 431. It will become 134. So the final array is 2134. int[] num = {1,4,3,2}; int index = -1; for(int i=n-1;i num[i-1]) index = i-1; } int temp = num[index]; num[index] = num[n]; Less

### How to discover if the given number is Power of 2 ?

return (( x!=0) &amp;&amp; (x &amp; (x -1) == 0)) a number which is power of two will have single 1 in binary representation ex. 16 00010000 x-1 will have pattern 00001111 hence x&amp;(x-1) will always be 0 for power of two numbers. Need to check condition for x!=0 since 0 is not a power of two. Special case to handle. Less

if you can figure this out inside an hour, congratulations this isnt something that should be in an interview to be honest the level of difficulty of the answer that algo came up with is at the level of an upper division course that has a proof of it written in wikipedia i honestly like the brute force solution Less

Divide the number by 2, and repeat, until the result is a not an integer number (in this case is not a power of 2) or the result is 1 (in this case the number was a power of 2). Less

### What data structure to use for Smartphone lock screen

A 3x3 2D array?, just store the sequence in which the blocks have to be selected

Graph data structure can be used, which consists of vertices, edges and x,y relation between vertices Less

graph (gesture) datastructure