Solution:

We believe you know that square is also a rectangle.

Solution:

If you take a look closely, you will acknowledge the fact that every symbol in the given figure is somehow associated with the surrounding one’s position. The upside-down spade is used to the left of a right-side-up heart every time.

Solution:

one fish, one cat and one dog.

Explanation:
The question might appear a bit difficult in the starting but if you analyze the statements, you will realize that it is just a tricky one.

All except two were fishes and all except two were cats. With these statements we can assume that two of the animals were not fishes and two were not cats. Now one of those animals that are not fishes can be a cat and one of those two animals that are not cats can be a fish. Just carry out the same analysis for the statement that all except two animals were not dogs and you will come across the result i.e.:
In that competition, there was one fish, one cat and one dog.

Solution:

The young lady was presented with a bill which belonged to the elderly woman. She had asked the waiter to collect the bill from her daughter.

Solution:

Isaac Newton picks up a piece of wood and lights it from the fire on the west end of the island.

He then quickly carries it near the east end of he island and starts a new fire. The wind will cause that fire to burn out the eastern end and he can then shelter in the burnt area.

(Funny Part : Isaac Newton survives the fire, but dies of starvation, with all the food in the forest burnt )

Solution:

A cigar stuck in the wall

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

3 1 2 2 1 1
1 3 1 1 2 2 2 1

Read Line as one 1 => 1
Read Line 2 as two one => 2 1
Read Line 3 as one two and one one => 1 2 1 1
and so on.

Solution:

Birbal drew another line that was larger than the pre-drawn line. Now the pre drawn line was smaller.

Solution:

I will be thrown at lions. Now if Akbar threw him at lions, Birbal’s statement will stand true and he will have to bury him alive. But if he bury him, the statement will emerge as false. Thus he had no choice left

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73