12345 a famous South Indian actor
567 is a path in jumbled form
8 & 10 are same letters
9 is one among the first six alphabets.
WHO AM I?

Two boys were admitted to a school. When the headmaster asks them about their parents, they tell him that they have same parents (father and mother). On further inquiry, it turns out that they both share the same date for their birthday.

"Are you twins," ask the headmaster.
"No," replies the boys.

Is it possible?

There are 20 people in an empty, square room. Each person has full sight of the entire room and everyone in it without turning his head or body, or moving in any way (other than the eyes). Where can you place an apple so that all but one person can see it?

What always comes into a house through the keyhole?

John, a 5-year-old boy, was really fond of the chocolates. He asked his Mother to give him some money to buy his favourite chocolates. His Mother gave him $45. He went to the shopkeeper and asked, "How much is one chocolate for?". The shopkeeper said $3 for one chocolate. Also, if you give me the wrappers of three chocolates, I will give you one for the exchange.
In total, how much chocolate could John eat?

Can you arrange four 9's and use at most 2 math symbols, to make the total 100?

John was writing his first book. After saving the document, he locked his laptop with a password and mentioned some phrases for the hint box.

A friend of his tried opening his laptop but found out that it was password protected. Following is the hint that appeared.
1 mobile 3 books 2 roars 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches.

Can you help him in cracking the password?

Name the three-letter word that can complete the below words?

A) L O _ _ _ E
B) E D U _ _ _ E
C) _ _ _ E R
D) _ _ _ T L E

Can you find a seven digit number which describes itself. The first digit is the number of zeros in the number. The second digit is the number of ones in the number, etc. For example, in the number 21200, there are 2 zeros, 1 one, 2 twos, 0 threes and 0 fours.

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?