What comes
Once in a Year
Twice in a Month
4 times in a Week
6 times in a Day

A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?

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]

In a basket of apples,
when counted in twos, there was one extra
when counted in threes, there were two extra when counted in fours, there were three extra
when counted in fives, there were four extra
when counted in sixes, there was five extra.

However, if the apples were counted in sevens, no extra apple was left. Can you calculate the minimum number of apples that were present in the basket?

You can take four of the five letters out of this word, but the pronunciation never changes. What is the word?

Which city is three-fifths chick two third cat and 50% goat?

A 52% bias toss for head using the 51% tail bias coin was done to obtain a fair result.

Can you find how bias is the floor in this case?

Who always enjoys poor health?

A prisoner is told: "If you tell a lie, we will hang you and if you tell the truth, we will shoot you." What did the prisoner say to save himself?

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?