There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

An apple seller is hosting a competition. He offers 1000 apples and 10 boxes to the people who pass by. The challenge is to put those 1000 apples in the 10 boxes in such a manner that if he asks for any amount of apples, the person can directly give him the boxes or a combination of boxes. If the person can do it, he promises to give a thousand apples for free.

If you happen to pass by the apple seller, will you be able to win a thousand apples?

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]

I had an infinite supply of water and 5 litres and 3 litres jars.

How would you measure exactly 4 litres in the least number of steps?

What number comes next in this sequence:
7 8 5 5 3 4 4 _

Find The Next Number In The Sequence

30 10 15 13 0 16 -15 ?

In front of you, there are 9 coins. They all look absolutely identical, but one of the coins is fake. However, you know that the fake coin is lighter than the rest, and in front of you is a balance scale. What is the least number of weightings you can use to find the counterfeit coin?

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?

If you go to the movies and you're paying, is it cheaper to take one friend to the movies twice, or two friends to the movies at the same time?

Can you find the next number in the below sequence
3 , 7 , 10 , 11 , 12 , 17 ?