The square root of number 121 is "11". What is the square root of the number "12345678987654321."?

A Child was born in Lahore, Pakistan. Still, the child is not a Pakistani citizen. why?

A bank customer had $100 in his account. He then made 6 withdrawals. He kept a record of these withdrawals, and the balance remaining in the account, as follows:

Withdrawals Balance left
$50 $50
$25 $25
$10 $15
$8 $7
$5 $2
$2 $0
----- -----
$100 $99

Why are the Totals not tallying?

On a charity event in Russia, Murray beat Djokovic by winning six games and losing three games.
Note: There is a total of 5 service breaks(one who serve lost the game).
Who served first, Djokovic or Murray?

There was once a troop of 5 elves. The 5 elves were very dedicated on finding the magical treasure of 1000 coins. However, being elves, they were super geniuses, very greedy and they did not hesitate in taking lives of other elves. The 5 elves were named Aye, Bee, Cee, Dee and Ee, ranked from high to low respectively, from Aye to Ee. One fine day, their efforts brought results and they found 1000 coins. Now they had to split it in between them as per their ranks. The lowest ranked elf has to make the proposal. If the proposal is accepted by majority, it is agreed, or the suggesting elf is killed.

What proposal should elf Ee make ?

Jenifer is learning to drive her car. She went down a one way lane and in the wrong direction. But she do not break any law.

How come ?

Bopanna was working on a murder case when he received a message about the location of the murder weapon.
The message was encrypted as below.

"deb mitciv eht edisni neddih si nopaew redrum ehT"

Tell me the location of the murder weapon.

An evil man kidnapped someone and made them take one of two pills. One was harmless, but the other was poisonous. Whichever pill the victim took, the kidnapper took the other one. The victim took their pill with water and died. The kidnapper survived. How did the kidnapper get the harmless pill?

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?

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?