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?
John walks into the daily grocery shop and steals a $100 bill from the shop. An hour later John returns to the shop and buys some daily products for $40. John pays the owner the $100 bill and therefore the owner returns him $60.
A man has to get a fox, a chicken, and a sack of corn across a river.
He has a rowboat, and it can only carry him and one other thing.
If the fox and the chicken are left together, the fox will eat the chicken.
If the chicken and the corn are left together, the chicken will eat the corn.
In the Wild West, you are challenged into a death match by two bounty hunters nicknamed Golden Revolver (GR) and Killer Boots (KB). You accept the challenge. None of you want to waste any of the bullet and so a certain rules are laid down:
1) All of you will shoot in a given order till the last man standing.
2) Each of you shoots only once upon his turn.
3) If any one of you is injured, the other two will finish him off with an iron rod.
4) The worst shooter of all (which is you) shoots first and the best one shoots at the last.
Now, how will you plan things if you know that you hit every third shot of yours, KB hits every second shot and GR hits every shot ?
Solve this tricky question. You are trapped in a forest. With you, you have a gun preloaded with two bullets in it. In front of you, there is a tiger, a leopard and a jaguar.
John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.
Seeking this behaviour, can you tell whether he likes balloons and parties?