What English word has three consecutive double 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?

You have a roll of cloth 1km long. You have a machine which cuts this roll into pieces of 10-meter-long cloth.

How long would it take for the machine to cut the roll if each cut took 4 secs?

The two towns are exactly 100 km apart. John leaves City A driving at 30 km/hr and Jacob leaves City B half an hour later driving at 60 km/hr. Who will be closer to City A when they meet?

Can you solve the tricky chess rebus puzzle below by ciphering the hidden meaning?

Use the digits from 1 up to 9 and make 100.

Follow the rules.
=> Each digit should be used only once.
=> You can only use addition.
=> For making a number, two single digits can be combined (for example, 4 and 2 can be combined to form 42 or 24)
=> A fraction can also be made by combining the two single digits (for example, 4 and 2 can be combined to form 4/2 or 2/4)

Question: how can we do this?

What does below chemistry rebus means?

Two Twins Jack and Jill were standing back to back and suddenly they started running in opposite direction for 4 kilometres and then turn to left and run for another 3 kilometres.

what is the distance between the Baggio twins when they stop ?

Can you find out the next digit in the following series ?

0, 0, 1, 3, 2, 6, 3, 9, 4, 12, 5, ?

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?