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.
In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.
A and B have a certain number of chocolates with them. If B gives one chocolate to A, they will have an equal number of chocolates. But if A gives one chocolate to B, then A will be left with half the number of chocolates that B has.
Can you find out the number of chocolates they have right now?
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.
There is so small cabin inside a deep forest.
All the forest burned out to worst possible but the inside of the cabin is still the same.
However all the person inside the cabin die.
A boy was driving a car, a girl took a lift from her. She asked his name. The boy said - my name is hidden in my car’s number, find it if you can. After this, she got down Car number was [ WV733N ] Can you guess the name now?