John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.

The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.

How many chocolates should he buy from each shop?

In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?

I am a seven-letter word but if you remove four of my letters I will have one left. What word am I?

You are confined in a room and given two metal rods. Out of these two rods, one is magnet and the other is the iron rod. They look starkly similar. You don't have any other metal object in the room.

How will you decide which one of those is magnet?

Find the Next Number in the Sequence

2 9 3 1 8 4 3 6 5 7 ?

Can you identify the famous TV character from the rebus below?

The two towns are exactly 100 km apart. John leaves City A driving at 30 km/hr and Jacob leaves City B half an hour later driving at 60 km/hr. Who will be closer to City A when they meet?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

We are a group of eight brothers. We consider the weak, yet we protect the king in every battle. If we move ahead, we never turn back. Who are we?

There's one "sport" in which neither the spectators nor the participants know the score or the leader until the contest ends.

What is it?