Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
1 rabbit saw 9 elephants while going to the river. Every elephant saw 3 monkeys going toward the river. Each monkey had 1 parrot in each hand. How many animals are going towards the river?
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?
A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.
An exterior architect is asked by a builder to plant seven trees in a manner that there are exactly six rows of trees in a straight line and each row has three trees in particular.
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.
