If you remove one from eleven, it becomes ten. If you remove one from nine, it becomes ten.

How is this possible?

If 21x = 79x, what is the value of x?

The Judge knows that Alamgir was killed by his girlfriend Jasline, but the judge is unsure whether to punish her. Why?

In a kingdom, King George did not allow any citizen to visit the world outside. Also, only a person with proper paperwork was allowed to enter or he was sent back. A wooden bridge was what connected the kingdom to the world. The king had appointed a sharpshooter who would check the every five minutes on the bridge to check. After checking, he would go back to his hut and return exactly after five minutes again. The bridge took 9 minutes to cross.

A merchant was able to escape the kingdom without harming the shooter. How?

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

In a stable, there are men and horses. In all, there are 22 heads and 72 feet. How many men and how many horses are in the stable

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?

While sitting in the Car, John suddenly finds that one of the wheels was missing. John noticed that a killer is approaching towards him. John cannot get out of the car.

How will John escape?

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?

Which digit occurred maximum times between the number 1 and 1000?