Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

I am white when I am dirty, and black when I am clean. What am I?

Known by all without exception, Forever here, for your protection, Sometimes strong, sometimes weak, Right after the night I come - hot and chic. And while millions of miles away, I always get to you, I find my way. No life around could do without me, Can you guess what I might be?

In the Thar desert, 3 men found a big 24L Jar is full of water. Since there is a shortage of water so they decided to distribute the water among themselves such that they all have equal amounts of it. But they only have a 13L, a 5L and an 11-litre Jar.

How do they do it?

An old Woman left INR 33,333 to be divided equally among two fathers and two sons and each was to receive INR 11,111.
How was this possible?

Using eight eights and addition only, can you make 1000?

The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Things are just as they seem, right? Well, check again.
Can you count the number of tigers in this picture ?

There are nine letters in the below-given diagram. You have to form a nine-letter word using these letters.

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?