A non-stop marathon is the shared favourite sport of three brothers.

*The oldest one is fat and short and trudges slowly on.
*The middle brother's tall and slim and keeps a steady pace.
*The youngest runs just like the wind, speeding through the race.

"He is young in years, we let him run!" the other two brothers explained, "'because though he is surely number one, he is second, in a way." Why is it?

Which of the following words don't belong in the group and why?
CORSET, COSTER, SECTOR, ESCORT, COURTS

What can run but never walk, have a mouth that never speaks, have a head that never weeps, and have a bed but never sleeps?

When I got four, I have it none.
When I got two, I have it some.
When I got none, I have it all.

What is it?

A guy in his thirties is found dead in a forest. The shocking thing about the body is that he is wearing his swimming trunks snorkel and a facemask.

For your information, the nearest lake is some 10 miles away and the sea is hundreds of miles away.

How did he die then?

What does the below image rebus riddle means ?

There are nine dots in the picture that has been attached with this question. Can you join all the dots by drawing four straight lines without picking up your pen?

Client Dempsey living in one of the East Coast states of the U.S. was talking to Landon Donovan, who was living in the West Coast state of the U.S.

Dempsey: What time is it?
Donovan: Wow, It is the same time here.

How is this possible?

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?