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]

You walk into a room and see a bed. On the bed, there are two dogs, five cats, a giraffe, six cows, and a goose. There are also three doves flying above the bed. How many legs are on the floor?

Why is the Hole below a Lock?

On rolling two dices (six-sided normal dice) together, what is the probability that the first one comes up with a 2 and the second one comes up with a 5?

How could a baby fall out of a twenty-story building onto the ground and live?

John was writing his first book. After saving the document, he locked his laptop with a password and mentioned some phrases for the hint box.

A friend of his tried opening his laptop but found out that it was password protected. Following is the hint that appeared.
1 mobile 3 books 2 roars 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches.

Can you help him in cracking the password?

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?

Can you name an animal whose killing cannot be performed without spilling your own blood?

What Adam and Eve do not have but the rest of the people have?

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?