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?
Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?
A man calls his dog from the opposite side of a river. The dog crosses the river without a bridge or a boat and manages to not get wet. How is this possible?
There's a day, that comes around once a year.
To celebrate the man, you hold dear.
He gave you life, love and will pick you up if you fall.
When it comes to guys like him, He's the best of all.
Who is he?
Two friends Smith and Andrew were talking about the bravery of their families. Smith told great stories about his courageous grandfather who fought for Britain in "World War I". Andrew told that his grandfather was so brave that in 1919 just after the war he was honoured with a bravery medal with the words "For our Courageous Soldiers In World War I" embedded into it. Smith knows that his friend is lying. How?