I have a clock(12-hour format) and both the needles of the clock overlap at 12:00.
After how much time, they will overlap again?

I have a five and a three-gallon jar. Assuming there is an infinite supply of water, how can I measure one-gallon water?

There are 100 bulbs in a room. 100 strangers have been accumulated in the adjacent room. The first one goes and lights up every bulb. The second one goes and switches off all the even-numbered bulbs - second, fourth, sixth... and so on. The third one goes and reverses the current position of every third bulb (third, sixth, ninth? and so on.) i.e. if the bulb is lit, he switches it off and if the bulb is off, he switches it on. All the 100 strangers progress similarly.

After the last person has done what he wanted, which bulbs will be lit and which ones will be switched off?

Aaron, Brad, Christopher, Danny and Elvis decided to play a game of tiddlywinks. In this game they decided that one win will get 1 point for winning, 0 for losing and 1/2 in case of a tie.

They finished the game in alphabetical order and it was found that the scores were different for each person.

Based on the following two statements, can you find out the result of the individual games?
Brad: No one could finish like me, without a loss.
Elvis: No one played worse than me, I finished without a single win.

Can you guess the name of the month by looking the below rebus ?

John and his team plan to rob a safe. They got just one chance to break the code else the local police will be informed. Below are clues:
A) Exactly one number is perfectly placed: 9 8 1
B) Everything is incorrect: 9 2 4
C) Two numbers are part of the code of the safe but are wrongly placed: 0 9 3
D) One number is part of the code of the safe but is wrongly placed: 1 4 7
E) One number is part of the code of the safe but is wrongly placed: 7 8 3

Tell me the Hindi name of a Vegetable which if we remove 1st word will become a precious Stone and by removing the last word it will become a sweet eatable.

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

A thief enters a store and threatens the clerk, forcing her to open the safe. The clerk says, “The code for the safe is different every day, and if you hurt me you’ll never get the code.” But the thief manages to guess the code on his own. How did he do it?

You are on your way to visit your Friend, who lives at the end of the hill. It is his birthday, and you want to give him the cakes you have made. Between your house and his house, you have to cross 5 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home to make sure that you arrive at a friend's house with exactly two