You can win me and lose me but never buy me
You can not eat me and never want to part with me
I can make you cry or bring you joy
I am not a machine and definitely not a toy
You keep me but i am not forever just yours
You might find me in a case or on a shelf next to a vase
I am hard and i am tall if you bump me i am sure to fall
I am made of different materials and am at many events
If your lucky and fight hard I might be yours
What am I ?
John was running from 40 thieves. John has got 3 gold boxes which weigh as 4kg, 2kg, and 1kg respectively. A witty man asked John to stay with him for seven days in exchange for 1kg gold per day. John needs to stay there for seven days and also do not want to give the witty man any advance. How can John pay for his seven days stay?
I have two coins.
* One of the coins is a faulty coin having a tail on both sides of it.
* The other coin is a perfect coin (heads on side and tail on other).
I blindfold myself and pick a coin and put the coin on the table. The face of the coin towards the sky is the tail.
What is the probability that another side is also tail?
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.
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.
