John went to meet his friend Jacob, but when he was about to reach the main gate, John notices that Jacob had a mighty dog who was fastened to the tree. The chain is long enough that it allows the dog to reach the main gate.

How can the John reach the main gate?

With pointed fangs I sit and wait; with piercing force I crunch out fate; grabbing victims, proclaiming might; physically joining with a single bite. What am I?

What number do you get when you multiply all of the numbers on a telephone's number pad?

Find the Next Number in the Sequence

2 9 3 1 8 4 3 6 5 7 ?

Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.

They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?

Decode the movie name from the below picture?

A word I know has six letters it contains, remove one letter and 12 remain. What is it?

Why 1729 is a magic number? Answer Logically.

A professor thinks of two consecutive numbers between 1 and 10.
'A' knows the 1st number and 'B' knows the second number

A: I do not know your number.
B: Nor do I know your number.
A: Now I know.

What are the four solutions for this?

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?