Outside a massage parlour, there is a board that reads
"I only massage those who do not massage themselves."

Reading the above statement, does the masseur massage himself?

4 fathers, 2 grand-fathers and 4 sons went to watch the movie.What is the minimum number of tickets they need to buy ?

Can you solve the below tricky visual equation?

At a bar, three friends, Mr Green, Mr Red and Mr Blue, were having a drink. One man was wearing a red suit; one a green suit; and the other a blue suit. 'Have you noticed,' said the man in the blue suit, 'that although our suits have colours corresponding to our names, not one of us is wearing a suit that matches our own names?' Mr Red looked at the other two and said, 'You're absolutely correct. What colour suit is each man wearing?

Kareena is older than Katrina and younger than Karishma. Isabelle is younger than Bipasha and Karishma. Bipasha is older than Karishma. If Kareena and Isabelle are the same age, who's the youngest?

Your job is to measure 45 minutes if you have only two cords and matches to light the cords.

1. The two cords are twisted from various materials, so their different segments can burn at different rates.
2. Each cord burns from end to end in exactly one hour.

Describe your way of measuring the 45 minutes.

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

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?

John said, "If yesterday was tomorrow, today would be Friday."

When did John make this statement?

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?