This puzzle can just blow up your mind. cracking it can land you up with worthy amount of Rs.1 crore as it was asked in a google interveiw.

© All Rights Reserved

1 views

This puzzle can just blow up your mind. cracking it can land you up with worthy amount of Rs.1 crore as it was asked in a google interveiw.

© All Rights Reserved

- Sensitivity
- Tutorial4_376-381
- Continuous and Discrete Signals and Systems - S. Soliman & M Srinath - Spanish
- Printable Midterm
- Adaptive Hybrid GA
- Sec_4_Pres3
- Problem 2.104
- New Health Index Analyses 052013
- hwset5sol
- lec_no._17_n_18....1.4.13
- Vii
- 12 - Managerial Decision Making and Mathematical Optimization Problems_21Feb2019
- Transform Coding II
- Computer Graphics Lab
- Optimized Extraction of MOS Model Parameters
- 00471573
- IJAIEM-2013-05-10-017
- Sequencing OR1
- ES 204 MP2
- dsppp

You are on page 1of 2

* Eggs can be very hard or very fragile means it may break if dropped from the f

irst floor or may not even break if dropped from 100 th floor.Both eggs are iden

tical.

* You need to figure out the highest floor of a 100-storey building an egg can b

e dropped without breaking.

* Now the question is how many drops you need to make. You are allowed to break

2 eggs in the process

If you are one of the people who likes to solve a puzzle before seeing the answe

r you must quit the blog now and come back later for checking the answer.

Now that this is a Google interview question I am taking the normal "Interview-S

tyle" of solving a problem. Simply saying thinking aloud through the solution fr

om worst to the best correcting the flows optimizing the solution or taking the

5-minute hard thinking acting pause to a problem, which you know already and jus

t want to make your interviewer think that you are a challenge lover.

Solution

Drop the first egg from 50.If it breaks you can try the same approach for a 50-s

torey building (1 to 49) and try it from 25th floor. If it did not break try at

75th floor. And use linear search with the remaining portion of storey we need t

o test. For example if the first egg breaks at 50 we need to try all possibiliti

es from 1 to 49.

Now this looks a feasible solution. In computer student's jargon do a binary sea

rch with first egg and linear search with the second one. Best case is log (100)

and worst is 50.

Now the optimal solution for the problem is that you figure out that you will ev

entually end up with a linear search because you have no way of deciding the hig

hest floor with only one egg (If you broke one egg and you have to find the answ

er among 10 all you can do is start from the lowest to the highest and the worst

is the total number of floors). So the whole question grinds up to how to make

use of the first egg to reduce the linear testing of the egg.

(For strict computer science students, well this problem can be solved using bin

ary search on the number of drops needed to find the highest floor.)

Now let x be the answer we want, the number of drops required.

So if the first egg breaks maximum we can have x-1 drops and so we must always p

ut the first egg from height x. So we have determined that for a given x we must

drop the first ball from x height. And now if the first drop of the first egg d

oesn t breaks we can have x-2 drops for the second egg if the first egg breaks in

the second drop.

Taking an example, lets say 16 is my answer. That I need 16 drops to find out th

e answer. Lets see whether we can find out the height in 16 drops. First we drop

from height 16,and if it breaks we try all floors from 1 to 15.If the egg don t b

reak then we have left 15 drops, so we will drop it from 16+15+1 =32nd floor. Th

e reason being if it breaks at 32nd floor we can try all the floors from 17 to 3

1 in 14 drops (total of 16 drops). Now if it did not break then we have left 13

drops. and we can figure out whether we can find out whether we can figure out t

he floor in 16 drops.

Lets take the case with 16 as the answer

1 + 15 16

1 + 14 31

1 + 13 45

1 + 12 58

1 + 11 70

1 + 10 81

1 + 9 91

1 + 8 100

task

if breaks at 31 checks from 17 to 30 in 14 drops

.....

Now finding out the optimal one we can see that we could have done it in either

15 or 14 drops only but how can we find the optimal one. From the above table we

can see that the optimal one will be needing 0 linear trials in the last step.

So we could write it as

(1+p) + (1+(p-1))+ (1+(p-2)) + .........+ (1+0) >= 100.

Let 1+p=q which is the answer we are looking for

q (q+1)/2 >=100

Solving for 100 you get q=14.

So the answer is: 14

Drop first orb from floors 14, 27, 39, 50, 60, 69, 77, 84, 90, 95, 99, 100... (i

.e. move up 14 then 13, then 12 floors, etc) until it breaks (or doesn't at 100)

.

Please feel free to correct or post any comment on the solution or the answer.

Links I found useful

- SensitivityUploaded byFelipe Oliveros
- Tutorial4_376-381Uploaded byEgidius Putrando
- Continuous and Discrete Signals and Systems - S. Soliman & M Srinath - SpanishUploaded byhops1
- Printable MidtermUploaded bydaeron16
- Adaptive Hybrid GAUploaded bySaheem Zafar
- Sec_4_Pres3Uploaded bysaturnino corpuz
- Problem 2.104Uploaded byEric Castillo Martínez
- New Health Index Analyses 052013Uploaded byericsson3gpp
- hwset5solUploaded byDauood Saleem
- lec_no._17_n_18....1.4.13Uploaded bySadiaAslam
- ViiUploaded byAdHam Averriel
- 12 - Managerial Decision Making and Mathematical Optimization Problems_21Feb2019Uploaded bycihtanbio
- Transform Coding IIUploaded byRakesh Inani
- Computer Graphics LabUploaded byRishabh Jain
- Optimized Extraction of MOS Model ParametersUploaded byTâm Nguyễn
- 00471573Uploaded bysuchi87
- IJAIEM-2013-05-10-017Uploaded byAnonymous vQrJlEN
- Sequencing OR1Uploaded byAkhilesh Vaishnaw
- ES 204 MP2Uploaded byWilliam Provido
- dspppUploaded byrkinkar4
- rilUploaded byAsir David
- Gate_ME_2014_4Uploaded bymuraliooooo
- plantlayoutUploaded byArunkumar Myakala
- CST232-Test-1-2015/2016Uploaded byAdron Lim
- evopUploaded byEdinson Raul Quispe
- DEMO PPT.pptxUploaded bygerwingavina
- Wavelet AnalysisUploaded byavb22
- Bootcamp2-TechnicalTestUploaded byabi
- ial01.pdfUploaded bySecundaria Técnica Tepeyahualco
- Decision_aids_tunneling.pdfUploaded bychin_kb

- Free Research Journals _ Publish Research Paper India _ IJEASTUploaded byChandru Badachi
- Issue 54 Radio Parts Group Newsletter - June 2009Uploaded byRadio Parts
- COMPARATIVE STUDY OF DIFFERENT KALMAN FILTER IMPLEMENTATIONS IN POWER SYSTEM STABILITYUploaded byChiawuen Tai
- Internal Audit HandbookUploaded byCA Santosh Srivastava
- MCS – 041 Block 1 Unit 3 Interprocess Communication and SynchronizationUploaded bydhabalia_kirit
- Oracle ExtractUploaded bySanjay Agarwal
- Handset CompatibilityUploaded byHajiAkbarBabar
- LITERACY IN THE LIVES OF THE BLIND: AN ETHNOGRAPHIC STUDY IN THE SAN FRANCISCO BAY AREAUploaded byfatma
- Performance report for Agen Sbobet depobet.comUploaded byFirmanu Swantara
- Spasi UnikUploaded byMuh Ilham
- chpt_15Uploaded byJuan Pablo Caicedo
- Paper1Uploaded byshreyasgs2008
- BCCPA.examcollection.premium.exam.242qUploaded byBruno Nunes
- Design-and-Implementation-of-High-Speed-Data-Transmission-over-Dual.pdfUploaded byBhavaniPrasad
- Curso Oficial Smc Rm CertifiedUploaded byGonzalo Nuñez
- 13-Unit13Uploaded bygaardi
- Voice RecognitionUploaded bySurya Karki
- 80c86Uploaded bySilvi San
- Ultrawire & Ultralink OverviewUploaded bygonzalito777
- Datastage_IssueResolution_JobAidUploaded byBrahmaReddyCBattula
- BentleyUploaded bylink2u_007
- Piping Examination and Leak Test GuidecccUploaded byrufino
- 1105Uploaded bySung Hyun Tak
- Five Steps to Workforce AnalyticsUploaded bym_moiceanu
- Assignment No 3 Course Code: CAP254 SYSTEMUploaded bySurendra Singh Chauhan
- CPDP Daily LogUploaded byNanda Pratama
- Hospital Software SolutionsUploaded byKriti Srivastava
- HP ProDesk 400 G1Uploaded byVu Nguyen
- TP-114349 FACUploaded bySurya Dharma
- How-To-Build-Websites-That-Sell-The-Scientific-Approach-To-Websites.pdfUploaded byMau Monroy