Solution:

Let us denote the four people with A, B, C and D.
A takes 1 minute to cross, B takes 2, C takes 5 and D takes 10.

A and B cross first spending 2 minutes.
A comes back with torch taking 1 minute.
C and D cross taking 10 minutes.
B comes back with torch taking 2 minutes.
Finally, A and B cross the bridge taking 2 minutes.

2 + 1 + 10 + 2 + 2 = 17 minutes

Thus, this is the way they all managed to cross that bridge that night.

Solution:

Assume that P, Q and R are the three friends. Now P is earning X amount, Q is earning Y amount and R is earning Z amount.

First, P will add his salary to a random amount A and will tell the combined sum to Q.
X + A

Now, Q will add his salary and a random amount B to the amount passed by P. He will then pass it to R.
X + A + Y + B

Now R will add his salary and a random amount C to the total amount passed by Q.
X + A + Y + B + Z + C.

Now, R will pass this amount back to P. P will deduct the random amount added by him in the beginning.
X + Y + B + Z + C

He will now pass this amount to Q who will subtract the random amount he added in his turn.
X + Y + Z + C

He will pass this amount to R who will deduct his random amount.
X + Y + Z

Now this is the total sum of their salaries. R will tell it to P and Q and then each of them can find the average of their salaries by dividing the total amount with 3.

Solution:

Let us first calculate the total number of matches that will be placed:
9C2 * 2
= 9! / (2!7!) * 2
= 8 * 9
= 72
Therefore, every team will play 16 matches.

Let us now glance over the cases that are possible.

Case 1:
Let us say that Team A, Team B and Team C wins 14 matches each (they lose 1 match each from the other two teams), then the Team D can win only (16 - 3 * 2) = 10 matches.

Case 2:
Suppose that, the top 4 teams win 13 matches each.
Team A will win 13 matches and will lose 3 matches from Team B, Team C and Team D.
Team B will win 13 matches and will lose 3 matches from Team A, Team C and Team D.
Team C will win 13 matches and will lose 3 matches from Team A, Team B and Team D.
Team D will win 13 matches and will lose 3 matches from Team A, Team B and Team C.

If this case actually happens, then the Team E will be able to win 8 matches at maximum as Team A, Team B, Team C and Team D will win all the matches played by E.

Case 3:
Suppose that, the top 5 teams win 12 matches each.
Team A will win 12 matches and will lose 3 matches from Team B, Team C, Team D and Team E.
Team B will win 12 matches and will lose 3 matches from Team A, Team C, Team D and Team E.
Team C will win 12 matches and will lose 3 matches from Team A, Team B, Team D and Team E.
Team D will win 12 matches and will lose 3 matches from Team A, Team B, Team C and Team E.
Team E will win 12 matches and will lose 3 matches from Team A, Team B, Team C and Team D.

If this case actually happens, Team E will win 12 matches but it still won't be able to get into the playoffs assuming that it has the lowest run rate among all.

This implies that from case 2, it is evident that a team must win 13 matches at the least to confirm its position in the playoffs.

Solution:

This is because the queue for buying a donut is extremely long due to which the car engine becomes cool and gives trouble. While the queue for buying brownie is pretty small and thus the car gives no trouble at all.

Solution:

This puzzle is quite similar to the cheating husbands puzzle. The same logic applies here.

After the announcement, if there is only one person with green eyes, he will observe everyone and will come to the conclusion that he himself has green eyes.

If two persons have green eyes, they will see everyone and find out that there is one person with green eyes. So they will expect him to leave. But if no one leaves on that day, on the next day both of them will understand that they both have green eyes and will leave the island.

Thus if you keep going like this or apply the rules of induction, you will find that since there are 100 green eyed people on that island, all of them will leave the island on the 100th day after the announcement.

Solution:

It is a lateral thinking puzzle and thus it's not about anything logical.

The man who walked in the movie theater was once a father of twin brothers. Despite of the fact that they were twins, their nature was starkly opposite. While David was quite peaceful and generous, Robin was very rude and violent.

On a certain day, David came running to the man and told him that Robin had killed a man. The man rushed to the crime scene with his son and saw that the man was dead with Robin near the body. He started fighting with Robin and accidentally killed him. The police arrested the man and he was sent to prison for ten years. While in his first month at the prison, he received a letter from his son which said that he was not interested in meeting him ever and that he can't forgive his father for what he did to his brother.

After ten years, he was released and came out of the prison only to know that his son was now a small time movie star and his latest movie was running in a nearby theater. While watching the movie, he smiled when he saw his son David on screen. But the next moment, the camera shifted on his arm where he saw a birthmark that belonged to Robin. He realized that on that day the one who came to him was not David but Robin and he actually killed David.

Filled with a grief and shock he decided to take his own life. He would have never forgiven himself for what he did to his son David.

Solution:

12 minutes

Explanation:
Yes, surely they can all make it out of the cave.

First, father and mother will go. Time taken = 2 minutes.
Father comes back. Time taken = 2 + 1 = 3 minutes.
Both children go. Time taken = 3 + 5 = 8 minutes.
Mother comes back. Time taken = 8 + 2 = 10 minutes.
Mother and Father go. Time taken = 10 + 2 = 12 minutes.

Thus in 12 minutes, all of them will be out of the cave through the tunnel.

Solution:

If you look into the picture, you can see the cut lines. If the four people cut along with the lines, each one of them will have 1/5th of the cake.

Solution:

The Pink servant is the truthful one.

In order to prove the same, let us take all of them one by one assuming that the selected one is telling the truth. This is because all of them are disagreeing with each other which means that three servants are lying while one is telling the truth.

Assume that the Orange servant is the truthful one. Under this condition, the orange one is having either 6 or 8 legs. And each of the other octopus is lying will then have 7 legs. Under this condition, the total number of legs will be 6 + 7 + 7 + 7 = 27 legs or 8 + 7 + 7 + 7 = 29 legs. But the Orange servant said that they have 28 legs all together. Thus he is lying.

Now if we simply follow the same logic with all other servants as well, we will come up to the conclusion that only the Pink servant is truthful.

Solution:

Let us solve this problem with variables to find the general nature. Let us assume that there are x black chocolates and y white chocolates. Three things can happen when you take out two chocolates.
1) You take out two black chocolates.
Then, you will be replacing one black chocolate and so the jar will have x+1 black chocolates and y-2 white chocolates.
2) You take out two white chocolates.
Then, you will be replacing 1 black chocolate and so the jar will have x-1 black chocolates and y white chocolates.
3) You take out 1 black chocolate and 1 white chocolate. Then, you will be replacing a white chocolate and so the jar will have x-1 black chocolates and y white chocolates.
Thus at every step, you are wither removing a black chocolate or replacing two white chocolates by one black chocolate irreversibly till there is just one chocolate left. Therefore each white chocolate is equivalent to two black chocolates.

This, if the number of white chocolates are odd in number, the last one remaining will be white chocolate and if the number of white chocolates are even in number, the last one remaining will be black chocolate.