If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
The interviewer has given me 100 marbles(50 white and 50 black) and two empty boxes.
He then told me that he will leave the room and i need to place all the marbles in two boxes.
And When he come back, he will draw a marble from any of the two box and if the marble is white I will be hired.
Also
* No box can be empty.
* All 100 marbles must be placed in one of the two boxes.
Create a number using only the digits 4,4,3,3,2,2,1 and 1. So i can only be eight digits. You have to make sure the ones are separated by one digit, the twos are separated by two digits the threes are separated with three digits and the fours are separated by four digits
Two prisoners Jack and Jill are locked in a cell.
There is open window approx 40 feet above the ground of the cell.
They are never able to reach there.
Then they plan to escape by a tunnel and they start digging out.
After digging for more than 20 days, Jill comes with the different plan and they escaped.
A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.
