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.
You have three orange, two pink and five purple balls in the drawer beside your bed. There is no electricity and the room is entirely dark. How many balls must you take out to ensure at least one ball of each colour at least?
A man is approaching a broad and barren land. He has a package with him. If somehow, he is unable to open the package before reaching the land, he will die.
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
Seven Robbers robbed a bank and hide the coins in a lonely place.
They decide to divide the money equally the next morning. Two greedy robbers decided to cheat the others and reach the place at night. They equally divided the coins between them, one coin left. So they called another robber and then they decided to divide equally among the three. Sadly again one coin left. The same thing happened to the 4th 5th and the 6th robber.
However, when the 7th robber reached in the morning, they can divide the coins equally.
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.