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?
Rose, Lily and Jasmine decided to buy flowers for their moms on Mother's Day. One of them bought lilies, the other roses, and the third one jasmines.
'It's funny!' said the girl with roses, 'we bought roses, jasmines and lilies, but none of us bought the flowers matching her name'.
'You're right!', said Lily.
What kind of flowers did each of the girls buy?
You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?
There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?
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?
