There are 2 sand hourglasses.

The small one can measure 5 hours and the large one can measure 7 hours.

How can we measure 16 hours with 2 sand hourglasses running together ?

He runs but never walks. Murmurs, but never talks. Has a bed, but never sleeps. And has a mouth, but never eats?

Move four matchsticks to the below square to form three squares?

John was so frustrated to be the suspect of being a sleeper terrorist that he shoot himself right between the eyes with a revolver in his toilet. The revolver and the bullets were accurate. Minutes later John walks out of the toilet unharmed.
How can this be possible?

Name the three-letter word that can complete the below words:

A) L O _ _ _ E
B) E D U _ _ _ E
C) _ _ _ E R
D) _ _ _ T L E

If all the below statements are true

1. Gianni was either in Italy or France in 1997.
2. If Gianni did not kill Versace, Hilton must have killed him.
3. If Versace died of suffocation, then either Gianni killed him or Versace committed suicide.
4. If Gianni was in Italy in 1997, then Gianni did not kill Versace.
5. Versace died of suffocation, but he did not kill himself.

Who killed Versace and where was Gianni in 1997?

I have branches, but no fruit, trunk or leaves. What am I?

In the given figure, move three matchsticks so that the resulting figure contains two rectangles.

Detective John was investigating a murder in China.
It was a difficult case, and John was completely stumped until he noticed a message sent to him by the killer cunningly hidden in a newspaper advertisement selling Car Licence Plates.
Detective John thought about it for a while, and when he had solved the puzzle, immediately arrested the guilty man.

Q1) How did John know the advert was a clue for him?

Q2) Solve the code and tell me who John arrested.

This is the newspaper advert (Car licence plates for sale) that Detective John saw.

Plates For Sale;

[W 05 NWO]
[H 13 HSR]
[O 05 EBM]
[D 08 UNE]
[U 10 HTY]
[N 04 BRE]
[N 16 TTE]
[I 26 LHC]
[T 10 AEE]
[I 26 CNA]
[X 22 VDA]

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?