Get the job puzzle

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

Problem A company plan to recruit people. But, ends up finding many more than eligible people.So, they plan a strategy to cut short the people to their suit the headcount of their requirement. People will be lined up in a queue 1, 2, 3… N. At first phase, people at odd locations will be eliminated. Same thing will apply for next phase. For example, Round 1: 1, 2, 3, 4, 5, 6…. [Read More]
kodeknight  brainteaser 

ATM Money Withdrawal Limit

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Problem Assumptions: a) I have infinite money in my account b) The daily limit of amount of money that can be withdrawn from an ATM is finite c) You can login into an ATM Machine only once a day d) If you login into the machine and enter a large number to withdraw, you will not get anything. And hence, you will not be able to withdraw anything from the ATM for the day. [Read More]
kodeknight  brainteaser 

Minimum Sips

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

Problem Given 1000 bottles of juice, one of them contains poison and tastes bitter. Spot the spoiled bottle in minimum sips. Solution We can do it in log(n) and that would be 10 sips. Of course it can be done in 1000 sips by checking each bottle but to do it in 10 sips you can take one drop from 500 bottles and mix them, if it is sour than the bottle is in those 500 or it is in different 500. [Read More]
kodeknight  brainteaser 

Aeroplanes round the world

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  3 minutes  |  Kinshuk Chandra

Problem On Bagshot Island, there is an airport. The airport is the homebase of an unlimited number of identical airplanes. Each airplane has a fuel capacity to allow it to fly exactly 1/2 way around the world, along a great circle. The planes have the ability to refuel in flight without loss of speed or spillage of fuel. Though the fuel is unlimited, the island is the only source of fuel. [Read More]
kodeknight  brainteaser 

River, Soldiers & Boat and children

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

Problem  Consider there are 10 soldiers on the one side of the river. They need to go to the over side of the rever. There is no bridge in the rever and no one can swin in the rever. One of the soldiers spots the boat with two boys inside. The boat is very small and the boys in the boats also very small. The boat can either hold two boys or one soldier. [Read More]
kodeknight  brainteaser 

Measure weights in balance

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Problem Puzzle 1: The puzzle is if the shopkeeper can only place the weights in one side of the common balance. For example if shopkeeper has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names the weights you will need to measure all weights from 1 to 1000. This is a fairly simple problem and very easy to prove also. [Read More]
kodeknight  brainteaser 

Last ball of Red Balls & Blue Balls

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  2 minutes  |  Kinshuk Chandra

Problem A bag has 20 blue and 14 red balls.Each time you randomly take two balls out of the bag.(Assume each ball has equal probability of being taken).You do not put the two balls back.Instead,if both balls are of same color,you add a blue ball to the bag;if they have different color,red ball is put in the bag.Assume that you have infinite supply of red and blue balls,if you keep on repeating this process ,what will be color of last ball left in the bag. [Read More]
kodeknight  brainteaser  medium 

Deck of cards - Pick the cards with same color

 Posted on May 10, 2014  (Last modified on August 7, 2020)  |  1 minutes  |  Kinshuk Chandra

Problem  A casino offers a card game using a normal deck of 52 cards.The rule is that you turn over two cards at a time.If both of them are red,they go to your pile ;if both are black they go to dealer’s pile;and if one black and one red they are simply discarded.The process is repeated until you go through all the 52 cards.If you have more cards in your pile you will get $100,otherwise(including ties)you will get nothing. [Read More]
kodeknight  brainteaser  incomplete