There are two insects on a tile. Insect X is sitting on one side of the tile (point A) and Insect Y is sitting opposite on the other side of the tile (point B). Now both of them decide to change their position and thus X starts crawling to point B and Y starts crawling to point A. When they meet and pass each other in between, X takes 20 seconds to reach B and Y takes just 5 seconds to reach A.
Can you calculate the total time each of the insects took to change their positions?
Before the start of the car race, John and Jacob have the same amount of fuel in their car. With this fuel, John can drive for 4 hours while Jacob can drive five hours.
After a time they realize that the amount of fuel left in John's car is 1/4th of the fuel in Jacob's.
You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.
Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.
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?
One night, a man runs away from home. He turns left and keeps running. After some time he turns left again and keeps running. Later, he turns left one more time and runs back home—but when he gets home, he finds a man in a mask. Who was the man in the mask?
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.