Can you find the key in the picture below?

You have to fill the below given grid in a manner that every row and column contains the digits 1 to 6. Also, make sure that the squares that are connected with each other must contains the same digit.

In a competitive exam, each correct answer could win you 10 points and each wrong answer could lose you 5 points. You sat in the exam and answered all the 20 questions, which were given in the exam.
When you checked the result, you scored 125 marks on the test.

Can you calculate how many answers given by you were wrong?

A car meter reading shows 72927 miles a palindromic number.
what is the minimum number of miles you would need to travel to see another palindromic number on the car meter reading?

Rahul decided to meet Simran so he boards a local train from Bombay station. Just after the station, there is a 1km long tunnel. The train starts and is now accelerating. Rahul is a claustrophobic guy, so what is the best position for him to sit?

One evening there was a murder in the home of a married couple, their son and daughter. One of these four people murdered one of the others. One of the members of the family witnessed the crime.

The other one helped the murderer.

These are the things we know for sure:

1. The witness and the one who helped the murderer were not of the same sex.

2. The oldest person and the witness were not of the same sex.

3. The youngest person and the victim were not of the same sex.

4. The one who helped the murderer was older than the victim.

5. The father was the oldest member of the family.

6. The murderer was not the youngest member of the family.

Who was the murderer?

The below mentioned letters have been placed in a order using a logic.

DEAD, BALL, FEAR, SHOP

Can you find the logic?

Quickly Solve this riddle

7 - 4 + 3 * 0 + 1 = ?

How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?