Solution:

I had 10 candies in the beginning.

Explanation:
Let us take and solve this problem in the reverse direction.

At the end, I was left with 1 candy. Let me take the extra one candy back from my younger son. Now since I gave him half of what I had, we must be having the same number of candies. I have 2, which means he also have 2. This implies that I was left with 4 candies after I gave some to the elder son.

Let me take back the extra candy from my elder son now. Now I have 5 candies. Since I gave him half of what I had, he must be having 5 candies as well. Thus, I had 10 candies in the beginning.

Solution:

1/2

one of two is the possibility
1. If any of the first 99 people sit in Abhishek seat, Abhishek will not get to sit in his own seat.
2. If any of the first 99 people sit in Aishwarya's seat, Abhishek will get to sit in his seat.

Solution:

None

The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.

Solution:

They use the bricks and dirt from the tunnel to stand on it.

Solution:

To do it, the marbles must be arranged as the vertices of an octahedron. If you are unsure, check the image below.

Solution:

C7 => B8
Exchange pawn for a knight

Check-Mate

GameOver

Solution:

You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village

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:

The attached picture shows you how you can do it. If you were able to deduce any other way, feel free to comment.

Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

They were playing tennis.

Tiger Phil
30 - 30
40 - 30 (Phil hit a bad shot)
Game won - 30 (Tiger hit an awesome shot)