Answer / chris uzdavinis

Taking the worst case scenario, the minimum number of
iterations required is 20. Here is why:

For N drops you can cover a range of the sum(1,..N), which
is n*(n+1) / 2.

If we have 200 potential heights to test, we solve n*(n+1) =
400, and using the quadratic equation gives us
19.5062490237426, rounding up to 20.

The sequence of tests would be drop at heights of:
20
39
57
74
90
105
119
132
144
155
165
174
182
189
195
200

(Notice, the distance between each level decreases by 1 to
account for the extra drop it took to get there.)

If the bulb does not break on a level, try the next higher
number in the above sequence. If it does break, then do a
linear search starting at the previous "level", plus 1.

Any answer that partitions segments into equal lengths will
be suboptimal.

Answer / ram kumar.y

make the stack into 14 sections such that 10 of them will
have 14 blocks each and rest of the 4 will have 15 blocks
each.i.e., 14*10+15*4=140+60=200 blocks.
coming from the bottom keep dropping the bulb from the
highest blocks in each sections. in the worst case scenario,
the bulb may break in last(14th) section.
with the second bulb, keep dropping the bulb from any one
end of that section(in this case 14th as its the worst case)
which has 15 blocks and the first bulb has been dropped from
one of the 15 blocks. so, it takes 14 more chances(at a
worst case) to find out the block from where the bulb breaks
when dropped. So, the total no. of iterations are 14+14=28(max).

Answer / shantanu_sanjeev

For the best solution the worst case max drops will be "24"

For this we divide it into
1st five blocks from bottom of size 20 : 5*20 = 100
Next ten blocks of top of size 10 : 10*10 = 100

This will have a worst case at 99 when there will be 24
drops and all other numbers above 99 will have less than 24
drops.

Answer / magnum

in the question it is asked "THE HEIGHT AT WHICH BULB BREAKS"
not the height from which u drop so the bulb breaks.so from whatever height u may drop, the bulb if it breaks,it will break only on the ground i.e. 0 feet.

Answer / md

200 feet is the max height.
Means bulb can break from any feet within the max limit.

In the worst case, no of iteration will be 200.

To make situation better.. lets segmentise the 200 feet in
X segments.
Then will experiment with one bulb from top of each
segments. Bulb may break at any trial. worst case bulb
breaks at last trial. iteration = X

Now need to find the exact feet among the particular
segment. This segment has 200/X feet span.

Hence Worst case : iteration I = X + (200/X)

Now the job is to find out value of X so that I is minimum.

X=10 or X=20 in worst case min no of iteration is 30

Answer / nikky

question is not clear!!!

Answer / chris uzdavinis

Minor typo in previous answer (#7): it should say ... we
solve n*(n+1) = 200

To help get the mindset of the answer, think of the question
differently at first. Rather than solve for the fewest
number of drops to cover a range, think about a twisted
version of that question: "given a fixed number of drops,
what range can be completely covered?"

Our constraints are we have two bulbs, and we're done once
the 2nd breaks, but if it doesn't break we can use it again.

Given only 1 drop, we can only cover a range of 1. Either
it breaks or it doesn't. (If we go higher than the first
level, we don't know if it would have broken at a lower level.)

Given 2 drops, we can cover a range of 3: first drop on 2,
if it breaks, try 1, if not, try 3.

Given 3 drops, we cover a range 1..6: First drop on 3, if
it breaks, try 1, then 2. If it doesn't break, drop #2 is
on 5. If breaks, try 4. If not, try 6.

Given 4 drops, we cover a range of 1..10:
Start on 4, if breaks, try 1,2,3. If not, try 7. If
breaks, try 5,6. If not, try 9. If breaks, try 8. If not
try 10.

And so on. Thus, for N drops, we start on level N. If it
breaks, start a linear search using the remaining bulb, from
1..N-1. Thus, it took a max of 20 drops. But if it doesn't
break, we try level N+(N-1). If it breaks, start a linear
search from N+1. Otherwise try N+(N-1)+(N-2). etc.

This series is clearly the sum from 1 to N drops.

So now that we know how big of a range we can cover given a
fixed number of drops. But the original question asks us to
cover a range of 200, and find the number of drops required.
We just find the smallest integral value for N such that
sum of 1..N >= 200, which is 20.

I gave the sequence of tests in the previous post.

Answer / vineeta agarwal

Max height = 200 feet
no of bulbs we have=2
in minimum iteration we need to find the height at which bulb will break...
i think we can find only range... not exact height...
first will divide 200/2=100 feet
we drop bulb from 100 feet if 1st bulb break than we have to find height from 0 to 100 feet.... than we drop 2nd bulb from 50 feet if break than our range is 0-50 else we do same thing from 75 feet..... just like that we do and will find the range....

Answer / viral avalani

No. of iterations will be minimum at height of 200 ft.

Answer / rajendra varma

100ft

You have 13 balls which all look identical. All the balls are the same weight except for one. Using only a balance scale, can find the odd one out with only 3 weighings? Is it possible to always tell if the odd one out is heavier or lighter than the other balls?

9 Answers   Sapient,

You have 14 apples. Your Friend Marge takes away 3 and gives you 2. You drop 7 but pick up 4. Bret takes 4 and gives 5. You take one from Marge and give it to Bret in exchange for 3 more. You give those 3 to Marge and she gives you an apple and an orange. Frank comes and takes the apple Marge gave you and gives you a pear. You give the pear to Bret in exchange for an apple. Frank then takes an apple from Marge, gives it to Bret for an orange, gives you the orange for an apple. How many pears do you have?

5 Answers  

what makes a road as abroad?

10 Answers  

Ekta got chocolates to give her friends on her Birthday. If she gives 3 chocolates to each friend, one friend will get only 2 chocolates. Also, if she gives 2 chocolates to each friends, she will left with 15 chocolates. How many chocolates Ekta got on her Birthday? and how many friends are there?

5 Answers  

Pinto says, "The horse is not Black." Sandy says, "The horse is either Brown or Grey." Andy says, "The horse is Brown." At least one is telling truth and at least one is lying. Can you tell the color of the horse?

3 Answers  

SkyFi city is served by 6 subway lines - A, E, I, O, U and Z. ? When it snows, morning service on line E is delayed. ? When it rains or snows, service on the lines A, U and Z is delayed both morning and afternoon. ? When the temperature drops below 20 C, afternoon service is cancelled on either line A or line O, but not both. ? When the temperature rises above 40 C, afternoon service is cancelled on either line I or line Z, but not both. ? When service on line A is delayed or cancelled, service on line I is also delayed. ? When service on line Z is delayed or cancelled, service on line E is also delayed. On February 10, it snows all day with the temperature at 18C. On how many lines service will be delayed or cancelled, including both morning and afternoon?

5 Answers   Infosys,

Replace the letters with the correct numbers. T W O X T W O --------- T H R E E

3 Answers  

How would you cut a cake in 8 pieces with only three cuts.

14 Answers   CTS, eClerx, Exilant, Google, Infosys,

All types of puzzles asked in SBI exam.

0 Answers   State Bank Of India SBI,

How many such pairs of letters are there in the word TERMINATE each of which has as many letters between them in the word as in the English alphabet ?

1 Answers   Diya,

u use any operation solve this problem 45-45=45

11 Answers   Royal Group, TCS,

There are 25 horses and only five tracks in a race. How do you find the second coming horse of all the 25 horses, provided there is no stop clock? (obviously, a horse cannot participate more than once in a race).

28 Answers   Amazon, Athena Health Care, Bloomberg, Citrix, Dreamz Group, Global Analytics, Juniper Networks, Microsoft, Oracle, Synopsis, UC Berkeley,