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?

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 is the last thing you take off before bed?

A man desired to get into his work building, however he had forgotten his code.
However, he did recollect five pieces of information
* Fifth number + Third number = 14
* The fourth number is one more than the second number.
* The first number is one less than twice the second number.
* The second number and the third number equals 10.
* The sum of all five numbers is 30.

What is the code ?

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

Rahul decided to meet Simran so he boards a local train from Bombay station. Just after the station, there is a 1km long tunnel. The train starts and is now accelerating. Rahul is a claustrophobic guy, so what is the best position for him to sit?

_ _ _ IE _ _
_ _ _ IE _
_ _ IE _ _
_ _ IE _
_ _ _ _ IE

Like you see, some letters have gone missing from these words that contain the IE pair at some or the other place. The letters that will be used to fill the blanks are given below. Use them and form meaningful words. Can you do that?

A, C, D, F, H, K, L, M, N, N, O, R, R, S, S, S, T, T, Y and Y.

A man in a car saw a Golden Door, Silver Door and a Bronze Door. What door did he open first?

There is one thing that goes round the house and also inside the house but never even share a brief touch. What is it?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?