Solution:

Yes.

Solution:

4

No Of circles in the number.

Solution:

It can be done in 8 moves as shown in the animated image below.

Solution:

The wise man told them to switch the horses and then race. In this manner, both of them will be willing to race as fast as they can to prove that the other horse (his own horse) is slow.

Solution:

If you notice the animated gif, you know that D, C and B are going to die. D dies directly after coming in contact with the object, C dies after being thrust by the spikes of the see-saw and B dies with the blue ball.

But consider the situation that the person at E stands for Ebola. Eventually A dies as well.

We thank 9gags for this awesome gif.

Solution:

The node can be connected as shown.

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa

Solution:

Four

As the window was closed it is obvious that the six candles that were not extinguished were lit till they melted away entirely. Thus only four candles that were extinguished remain at the end.

Solution:

The bridge won't break.

When the car has travelled half of the bridge, that is 15km, the car must have used more than 300 grams of fuel. Therefore, the impact of bird's added weight will be zero literally.

Solution:

5 leopard and one sheep

since all animal are rational , once 1st leopard eats the sheep all the rest of leopard would know about this.

Solution:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.