During an interview, the interviewer ordered hot coffee for the candidate to relieve the stress. The coffee was kept before him. After a minute, the interviewer asked him, 'What is before you?' He replied 'Tea'.
You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).
Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?
A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.
Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?
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 ?
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
