A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.
Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?
It can't be seen, can't be felt, can't be heard, and can't be smelt.
It lies behind stars and under hills, And empty holes it fills.
It comes first and follows after, Ends life, and kills laughter.
What is it?
Doctor Alex and a bus driver John are both in love with the same woman named Olivia. The bus driver need to go for a long trip of 10 days, Before he left he gave Olivia 10 apples.
You are given 2 eggs.
You have access to a 100-storey building.
Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor, Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process
You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.
How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?
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?