If,

A = 1

B = 2

C = 3

...

...

Z = 26.

Based on above rule, you need to find an eleven letter word whose letter sum is equal to 52.

Who are the happiest people in IPL match?

A pet show was happening in my locality. I went down along with my kids. In that show, I noticed that all except two of the entries were cats. All except two were dogs and all except two were Monkeys.

Can you find out how many of each animals were present in that pet show?

A man wants to cross the pit of fire which is 25 feet in length and he has 2 planks(fire resistant) 19 feet in length. How can he cross the pit of fire alive?

What does this rebus means ?

A Miser man decided to go on a vacation for a month. He goes to the bank and asks for a trip loan of $500. The bank officer asks the man that the loan can only be approved when he mortgage some valuable thing at the bank. Miser man mortgages his only car whose worth was a whopping $80000. The Bank officer laughed at him and approve the loan instantly. After vacation when the miser man returns, the bank officer asked him "Are you an idiot, why is your mortgage such an expensive car for such a short loan?".

Miser man replied with some reason and the bank officer agreed that the miser man is actually not an idiot.

What did miser man reply to the bank loan officer?.

There are three boxes. One is labeled "APPLES" another is labeled "ORANGES". The last one is labeled "APPLES AND ORANGES". You know that each is labeled incorrectly. You may ask me to pick one fruit from one box which you choose.

How can you label the boxes correctly?

I have some blue and red sock in my drawer. I have a total of 4 socks. I pick 2 socks and the chance that I get a pair of red socks is 1/2.

What is the chance of picking a pair of blue socks?

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

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?