There are four 3-link chains. All you have to do is join them into a big 12-link chain. For joining two closed links, one of the links must be cut and placed onto the other link for closing.

How many minimum links will you have to cut to make the big chain?

A solo dice game is played. In this game, upon each turn, a normal pair of dice is rolled and the score is calculated not by adding the numbers but multiplying them.

In a particular game, the score for the second roll is five more than what was achieved in the first roll. The score for the third roll is six less than what was completed in the second roll. The score for the fourth roll is eleven more than what was achieved in the third. The score for the fifth roll is eight less than what was completed in the fourth.

Can you calculate the score for each of the five throws?

There are 3 apples in the basket and you take away 2. How many apples do you have now?

The more it dries, the wetter it becomes. Can you tell what it is?

There was a competition where the contestants had to hold something. At the end of the event, the winner was a person who had no hands or feet. What was it that the contestants had to hold?

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

I am weightless, but you can see me. Put me in a bucket, and I'll make it lighter. What am I?

With the help clues provided in the image, can you find the 5 digit key?

An exterior architect is asked by a builder to plant seven trees in a manner that there are exactly six rows of trees in a straight line and each row has three trees in particular.

How will he do it?

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?