If you’ve got me, you want to share me; if you share me, you haven’t kept me. What am I?

A man in a car saw a Golden Door, Silver Door and a Bronze Door. What door did he open first?

I sleep during the day and fly at night, but I have no feathers to aid my flight. What am I?

Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.

They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?

We have arranged an array of numbers below. What you have to do is use any kind of mathematical symbol you know excluding any symbol that contains a number like cube root. You can use any amount of symbols but you have to come up with a valid equation for all of them.

0 0 0 = 6
1 1 1 = 6
2 + 2 + 2 = 6
3 3 3 = 6
4 4 4 = 6
5 5 5 = 6
6 6 6 = 6
7 7 7 = 6
8 8 8 = 6
9 9 9 = 6

Can you find out what is missing?

1 3 5
2 4 ?

Hint: It's not six. Think out of the box.

A game is being played where eight players can last for thirty-five minutes. Six substitutes alternate with each player in this game. Thus, all players are on the pitch for the same amount of time including the substitutes.

For how long is each player on the pitch?

A swimming pool has four faucets. The first can fill the entire pool with water in two days, the second in three days, the third in four days, and the last one can fill the pool in 6 hours.
How long will it take to fill the pool using all 4 faucets together?

As shown in the picture below, we can see a boy hanging on the tree branch to save his life. There are various ways in which he can die like1. A snake hanging toward the right waiting to bite the boy.2. A roaring Lion near the tree.3. Two crocodiles are ready to attack if the boy reaches near water. The tree is chopped to some extent, so can fall as if he moves a lot. Can you give this boy an escape plan?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?