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?

The dirtier I get, the whiter I look. Who am I?

Why is the Hole below a Lock?

Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.

On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?

Replace the letters of words with a number so that the below equation holds true

BASE +
BALL
---------
GAMES
----------

It is Secret Agent Bond Girl Friend's birthday but he is on a secret mission

Mr Bond has a secret device by which he can only use the below words for sending the message.

Dumbo, Nazi, Carrot, Ronda, Zambia, Racing, TinTin, Seou, Zareeba, Laltain, Saphire, Tar, Orphan, Audition, Biscotti.

Mr Bond sends the following message to her girlfriend:
Carrot Dumbo Nazi Racing Ronda Zambia TinTin Seou Laltain Zareeba Tar Biscotti Orphan Audition Snake

What does Mr. Bond's Message say?

Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

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

AB * C = DE - F = GH / I

Solve the following series:
AZ, GT, MN, __, YB