If 5 cats catch 5 mice in 5 minutes, how long will it take one cat to catch a mouse?

In the image below, can you find the value of an angle(y)

You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.

Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.

You ask him, "Does either of the family have a girl?"

To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."

Which family do you think is likely to have a girl?

You have 1023 apples and 10 bags. You have to distribute these apples in these 10 bags in any way you choose. But when I ask for a certain number of apples you have to give them in terms of bags without transferring the apples from other bags. How do you distribute the apples?

A and B have a certain number of chocolates with them. If B gives one chocolate to A, they will have an equal number of chocolates. But if A gives one chocolate to B, then A will be left with half the number of chocolates that B has.

Can you find out the number of chocolates they have right now?

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.

A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them into two equal halves.

Can you help him divide the land in a manner that both of his sons will be happy?

f you were running a race, and you passed the person in 2nd place, what place would you be in now?

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?

You need to pick one entry from pot A and one from pot B to have a perfect match. Can you do it?