Below the four parts have been reorganised. The four partitions are exactly the same in both arrangements. Why is there a hole?

Suppose you are sitting in an interview and the interviewee asks you an aptitude question.

You have three buckets with a capacity of 4 litres, 8 litres and 10 litres and you have a large tank of water. Now you have to measure 3 litres of water precisely using those buckets. How will you do it?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

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]

Can you tell a 3D object that has just two surfaces?

How is a fly different from a mosquito?

You have two buckets - one holds exactly 5 gallons and the other 3 gallons. How can you measure 4 gallons of water into the 5 gallon bucket?

(Assume you have an unlimited supply of water and that there are no measurement markings of any kind on the buckets.)

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

What breaks yet never falls, and what falls yet never breaks?

Can you solve below mathematical equation?

2^1234 - 2^1233