John, Jack and Jill are in a desert. John doesn't like Jill and hence decides to murder him. He poisons the water supply of Jill. Since it is a desert area, Jill must drink or he will die of thirst.

Jack does not know of the actions of John and also decides to murder Jill. To succeed in his ill motives, he removes the water supply of Jill so he dies of thirst.

Jill dies due to thirst. Who murdered Jill?

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

Some friends went on a vacation to a resort. It was raining heavily and it kept raining for thirteen days.

When it rained in the morning, the afternoon was beautiful and when it rained in the afternoon, the day was blessed with a clear morning.

Overall, the friends experienced eleven nice mornings and twelve nice afternoons. Can you find out the number of days they spent on vacation?

In the following series, a set of numbers is progressing with a particular pattern. Can you deduce that pattern and find the missing set?

(2 + 6), (21 + 6), (58 + 6), (119 + 6), ___

A game is being played where eight players can last for thirty-five minutes. Six substitutes alternate with each player in this game. Thus, all players are on the pitch for the same amount of time including the substitutes.

For how long is each player on the pitch?

How will you measure 15 minutes using two hourglasses of 7 minutes and 11 minutes respectively?

A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?

An apple seller is hosting a competition. He offers 1000 apples and 10 boxes to the people who pass by. The challenge is to put those 1000 apples in the 10 boxes in such a manner that if he asks for any amount of apples, the person can directly give him the boxes or a combination of boxes. If the person can do it, he promises to give a thousand apples for free.

If you happen to pass by the apple seller, will you be able to win a thousand apples?

A newspaper is supposed to have 60 pages, but pages 24 and 41 are missing.
Which other pages won't be there?

Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?