In a kingdom, King George did not allow any citizen to visit the world outside. Also, only a person with proper paperwork was allowed to enter or he was sent back. A wooden bridge was what connected the kingdom to the world. The king had appointed a sharpshooter who would check the every five minutes on the bridge to check. After checking, he would go back to his hut and return exactly after five minutes again. The bridge took 9 minutes to cross.

A merchant was able to escape the kingdom without harming the shooter. How?

You may enter, but you may not come in. I have space, but no room. I have keys, but open no lock. What am I?

Replace each alphabet with the number (1-9) to make the below equation correct.

AB * C = DE - F = GH / I

A mile-long train is moving at sixty miles an hour when it reaches a mile-long tunnel. How long does it take the entire train to pass through the tunnel?

There is a bag which have 21 blue balls and 23 red balls. You also have 22 red balls outside the bag. Randomly remove two balls from the bag. * If they are of different colors, put the blue one back in the bag. * If they are the same colour, take them out and put a red ball back in the bag. Repeat this until only one ball remains in the bag. What is the color of the sole ball left in the bag ?

One day, I thought of ways that can be used for creating a palindrome. So I decided that I will turn into a larger number by adding the reversed digits to the original number and keep doing it till I finally obtained a palindrome.

I am not sure if this process will always result in a palindrome eventually but I was able to produce a four-digit palindrome. Can you guess my starting number?

What occurs twice in a week, once in a year but never in a day?

Alex opened 24 presents
Jonah opened 8 presents
Clara opened 1 present

Can you find out how many presents were opened by Candy?

An ape is trying to climb on a pole that is 60 feet high. Due to the slippery surface, the ape climbs 3 feet in a minute only to slip back 2 feet.

How much time do you think the monkey will take to reach the top of the pole?

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?