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.
You enter your friend's room. He is not in his room. Although you see that on the bed there are two dogs, five cats, two giraffes and three pigs. Also, a couple of chickens and ducks are flying in the room.
Calculate the number of legs standing on the floor.
A person was killed at a house party. When the police arrive, there are six people present in the house who are the friends of the victim. The name of the friends is Rohit, Aman, Nick, Gagan, and Randy.
Near the dead body, they find a few numbers written with blood by the victim on the floor. The numbers are 8, 5, 4, and 11.
The police arrests one of the friends for the murder. Whom did they arrest and why?
John was working on a Chemical Mixture whose weight comprise 90% liquid and 10% solid. The total weight of the mixture is 20 pounds. After a while, John noticed that some of the liquid evaporated and now the liquid comprises just 50% of the weight.
Jessica is telling her friends this story and asks them to guess if it’s the truth or a lie: “There was a man sitting in a house at night that had no lights on at all. There was no lamp, no candle, and no other source of light. Yet, he sat in the house and read his book happily.†Her friends say she’s lying, but Jessica corrects them and says she’s telling the truth. Jessica’s story is true—but how?
A tree doubled in height each year until it reached its maximum height over the course of ten years. How many years did it take for the tree to reach half its maximum height?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
