Can you replace the question mark with the correct number?

Replace the question mark with the number below given a simple math problem.

In a particular village, only two barbershops exist.

The first shop has a handsome barber with a neat haircut who is handsomely dressed in clean clothes and is extremely humble with his body language. The place is clean and looks hygienic.

In the second shop, you can find a barber with shabby clothing. His hairs are weirdly cut and his clothes still have the stains from last night's dinner. The place is not clean as well and reeks a bit.

You visit the village for the first time and decide to get your haircut. Which barbershop will you like to go for that and why?

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

Is the statement valid that it does not matter how much older a sibling is, eventually the younger one will be half as old as the older one?

What is the largest amount of money that you can possess in change and still if someone asks you for a dollar, you won't be able to give?

You walk into a creepy house by yourself. There is no electricity, plumbing, or ventilation. Inside you notice 3 doors with numbers on them. Once you open the doors you will die a particular way. Door No.1 You’ll be eaten by a lion who is hungry. Door No.2 You’ll be stabbed to death. Door No.3 There is an electric chair waiting for you. Which door do you pick?

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?

Can you discover the missing number in this series?

37, 10, 82
29, 11, 47
96, 15, 87
42, ?, 15

A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?