I am eight letters long - "12345678"
My 1234 is an atmospheric condition.
My 34567 supports a plant.
My 4567 is too appropriate.
My 45 is a friendly thank-you.
My 678 is a man's name.

What word am I?

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?

Aaron, Brad, Christopher, Danny and Elvis decided to play a game of tiddlywinks. In this game they decided that one win will get 1 point for winning, 0 for losing and 1/2 in case of a tie.

They finished the game in alphabetical order and it was found that the scores were different for each person.

Based on the following two statements, can you find out the result of the individual games?
Brad: No one could finish like me, without a loss.
Elvis: No one played worse than me, I finished without a single win.

Edward James went for tiger hunting.

It was not his lucky day.



He got six tigers without heads, nine tigers without the tail and eight cut in two halves.

How many tiger did he hunted ?

Below rebus represent famous DiCaprio movie. Can you name it?

I am white when I am dirty, and black when I am clean. What am I?

Which digit occurred maximum times between the number 1 and 1000?

In a certain bank, a man deposits a certain amount. According to the bank policies, the amount will be doubled up in a year but as the service charge, they will also deduct Rs. 65 by the end of every year.

If after the 6th year, the amount becomes 0, what do you think is the original amount he deposited in the bank?

You have two jars of chocolates labelled as P and Q. If you move one chocolate from P to Q, the number of chocolates on B will become twice the number of chocolates in A. If you move one chocolate from Q to P, the number of chocolates in both the jars will become equal.

Can you find out how many chocolates are there in P and Q respectively?

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.