Minimum visit=1 and Maximum vist=2

On Switch A and check (visit one )

if bulb is on then Switch a is bulb switch if not

Turn off A and turn on B, go to room and check (second visit)

if bulb is on the switch B is bulb switch , else switch C

Minimum visit=1 and Maximum vist=2

On Switch A and check (visit one )

if bulb is on then Switch a is bulb switch if not

Turn off A and turn on B, go to room and check (second visit)

if bulb is on the switch B is bulb switch , else switch C

We have only 2 eggs if both eggs are broke.  we can’t use more eggs

this is actual algorithm to find the Nth step

1. We need to start from 1st floor and throw the egg
2. If egg didn’t broke  move to 3rd floor (+2)
3. and we can continue till 99 if egg didn’t break in 99th floor then 100th floor is Nth
4. if the egg break in anywhere(ex: 57) we need to check x-1 floor too with another egg ( so 56th)
5. if the egg break on 56th floor then 56 floor is N otherwise 57 is  N

We have only 2 eggs if both eggs are broke.  we can’t use more eggs

this is actual algorithm to find the Nth step

1. We need to start from 1st floor and throw the egg
2. If egg didn’t broke  move to 3rd floor (+2)
3. and we can continue till 99 if egg didn’t break in 99th floor then 100th floor is Nth
4. if the egg break in anywhere(ex: 57) we need to check x-1 floor too with another egg ( so 56th)
5. if the egg break on 56th floor then 56 floor is N otherwise 57 is  N