What English word has three consecutive double letters?

A cricket has 6 legs, a squirrel has 4 legs and a spider has 8 legs.

In a local zoo, it was found that the total number of legs is 612. Also, there are equal number of each of the above animals/insects.

Can you find out how many animals are there in the zoo?

This is a most unusual paragraph. How quickly can you find out what is so unusual about it? It looks so ordinary, you'd think nothing was wrong with it. Actually, nothing IS wrong with it. But it is not as ordinary as you might think. If you think about it for a bit, you will find out why it is truly so unusual. So what is it? What is so unordinary about this paragraph?

Why do people go to bed?

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

What is next number in the pattern below:

131 517 192 123 ?

Railroad Crossing, look out for the cars. Can you spell that, without any R's ?

Kareena is older than Katrina and younger than Karishma. Isabelle is younger than Bipasha and Karishma. Bipasha is older than Karishma. If Kareena and Isabelle are the same age, who's the youngest?

0 0 0 = 6
1 1 1 = 6
2 2 2 = 6
3 3 3 = 6
4 4 4 = 6
5 5 5 = 6
6 6 6 = 6
7 7 7 = 6
8 8 8 = 6
9 9 9 = 6

You can use any mathematical symbols in the space provided to make all above algebraic expressions true.

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?