This action might not be possible to undo. Are you sure you want to continue?
After a while, he learns that the bartender has three children. "How old are your children?" he asks. "Well," replies the bartender, "the product of their ages is 72." The man thinks for a moment and then says, "that's not enough information." "All right," continues the bartender, "if you go outside and look at the building number posted over the door to the bar, you'll see the sum of the ages." The man steps outside, and after a few moments he reenters and declares, "Still not enough!" The bartender smiles and says, "My youngest just loves strawberry ice cream." How old are the children? A variant of the problem is for the sum of the ages to be 13 and the product of the ages to be the number posted over the door. In this case, it is the oldest that loves ice cream. Then how old are they? Answer : First, determine all the ways that three ages can multiply together to get 72: 72 1 1 (quite a feat for the bartender) 36 2 1 24 3 1 18 4 1 18 2 2 12 6 1 12 3 2 942 981 833 662 643 As the man says, that's not enough information; there are many possibilities. So the bartender tells him where to find the sum of the ages--the man now knows the sum even though we don't. Yet he still insists that there isn't enough info. This must mean that there are two permutations with the same sum; otherwise the man could have easily deduced the ages. The only pair of permutations with the same sum are 8 3 3 and 6 6 2, which both add up to 14 (the bar's address). Now the bartender mentions his "youngest"--telling us that there is one child who is younger than the other two. This is impossible with 8 3 3--there are two 3 year olds. Therefore the ages of the children are 6, 6, and 2. Pedants have objected that the problem is insoluble because there could be a youngest between two three year olds (even twins are not born exactly at the same time). However, the word "age" is frequently used to denote the number of years since birth. For example, I am the same age as my wife, even though technically she is a few months older than I am. And using the word "youngest" to mean "of lesser age" is also in keeping with common parlance. So I think the solution is fine as stated. In the sum-13 variant, the possibilities are:
* Now the question is how many drops you need to make. the number of drops required. leaving the childern with ages of 9. Simply saying thinking aloud through the solution from worst to the best correcting the flows optimizing the solution or taking the 5-minute hard thinking acting pause to a problem. which you know already and just want to make your interviewer think that you are a challenge lover. and 2.Both eggs are identical. You are allowed to break 2 eggs in the process If you are one of the people who likes to solve a puzzle before seeing the answer you must quit the blog now and come back later for checking the answer. This puzzle is famously known as 2 Egg Problem. Puzzle : Two Egg Problem: * You are given 2 eggs. Now that this is a Google interview question I am taking the normal "Interview-Style" of solving a problem. Then many companies asked this Puzzle during their interview or written test in campus. 2.11 1 1 10 2 1 931 922 841 832 751 742 733 661 652 643 The two that remain are 9 2 2 and 6 6 1 (both products equal 36). * 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 100 th floor. The final bit of info (oldest child) indicates that there is only one child with the highest age. Extra puzzles: This Puzzle is asked by Google while they had an interview to a select student for their company. The puzzle is given below. * You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking. Answer : Let x be the answer we want. This cancels out the 6 6 1 combination.
there is an airport.+ (1+0) >= 100.. 50. That I need 16 drops to find out the answer. The planes have the ability to refuel in flight without loss of speed or spillage of fuel.. So we have determined that for a given x we must drop the first ball from x height.. 84. The reason being if it breaks at 32nd floor we can try all the floors from 17 to 31 in 14 drops (total of 16 drops). Let 1+p=q which is the answer we are looking for q (q+1)/2 >=100 Solving for 100 you get q=14.. 95.. then 12 floors. etc) until it breaks (or doesn't at 100).. 77. Lets take the case with 16 as the answer 1 + 15 16 if breaks at 16 checks from 1 to 15 in 15 drops 1 + 14 31 if breaks at 31 checks from 17 to 30 in 14 drops 1 + 13 45 . 99. 1 + 12 58 1 + 11 70 1 + 10 81 1 + 9 91 1 + 8 100 We can easily do in the end as we have enough drops to accomplish the task Now finding out the optimal one we can see that we could have done it in either 15 or 14 drops only but how can we find the optimal one. The airport is the homebase of an unlimited number of identical airplanes.e. What is the fewest number of aircraft necessary to get one plane all the way around the world assuming that all of the aircraft must return safely to the airport? How did you get to your answer? Notes: (a) Each airplane must depart and return to the same airport. . First we drop from height 16. (i.. Each airplane has a fuel capacity to allow it to fly exactly 1/2 way around the world..and if it breaks we try all floors from 1 to 15. (b) Each airplane must have enough fuel to return to airport. and we can figure out whether we can find out whether we can figure out the floor in 16 drops. From the above table we can see that the optimal one will be needing 0 linear trials in the last step. The puzzle question is : On Bagshot Island. along a great circle. And now if the first drop of the first egg doesn’t breaks we can have x-2 drops for the second egg if the first egg breaks in the second drop. and that is the only airport they can land and refuel on ground. Though the fuel is unlimited. 60. 90. So the answer is: 14 Drop first orb from floors 14.. So we could write it as (1+p) + (1+(p-1))+ (1+(p-2)) + .So if the first egg breaks maximum we can have x-1 drops and so we must always put the first egg from height x. Lets see whether we can find out the height in 16 drops.. 100. 69.If the egg don’t break then we have left 15 drops. lets say 16 is my answer. Now if it did not break then we have left 13 drops.. move up 14 then 13. the island is the only source of fuel. 27.. so we will drop it from 16+15+1 =32nd floor. 39. Taking an example...
After 1/6 of the circumference. The possible letters are 'L'. Answer : As per the puzzle given ablove The fewest number of aircraft is 3! Imagine 3 aircraft (A. B and C). A rover's position and location is represented by a combination of x and y co-ordinates and a letter representing one of the four cardinal compass points. and any different answers. 'L' and 'R' makes the rover spin 90 degrees left or right respectively. Assume that the square directly North from (x. Now in the same manner as before both B and C fully refuelled fly towards A. At this point C completely fills the tank of A which is now able to fly to a point 3/4 of the way around the world. C reaches A at the point where it has flown 3/4 around the world. N. C has now only 1/3 of its full fuel capacity left. B passes 1/3 of its fuel to C and returns home. 'M' means move forward one grid point.(c) The time and fuel consumption of refueling can be ignored. NASA sends a simple string of letters. The plateau is divided up into a grid to simplify navigation. An example position might be 0. Write your comments. All three aircraft start at the same time in the same direction. which is curiously rectangular. and both "auxiliary" aircraft are the able to return safely to the home base. if the refuelling process is applied analogously as for the first phase of the fligh Mars Rovers thoughtworks puzzles A squad of robotic rovers are to be landed by NASA on a plateau on Mars. (so we can also assume that one airplane can refuel more than one airplanes in air at the same time. must be navigated by the rovers so that their on-board cameras can get a complete view of the surrounding terrain to send back to Earth. not enough to get back to the home base. and maintain the same heading. INPUT: . This plateau. In order to control a rover. C continues to fly alongside A until they are 1/4 of the distance around the world. But the first "auxiliary" aircraft reaches it in time in order to refuel it. where it is refuelled and starts immediately again to follow A and C. y+1). y) is (x. A is going to fly round the world. 0. 'R' and 'M'. All 3 aircraft can safely return to the home base. which means the rover is in the bottom left corner and facing North. without moving from its current spot. What is the fewest number of airplanes and number of tanks of fuel needed to accomplish this work? (we only need airplane to go around the world) solution for this puzzle is given below..) (d) The amount of fuel airplanes carrying can be zero as long as the other airplane is refueling these airplanes. Again B refuels C and returns home to be refuelled.
INPUT AND OUTPUT: Test Input: 55 12N LMLMLMLMM 33E MMRMMRMRRM Expected Output: 13N 51E ========== Prisoners and Hats Puzzles: The prisoners and hats puzzle is an induction puzzle (a kind of logic puzzle) that involves reasoning about the actions of other people. the lower-left coordinates are assumed to be 0. The prisoners can see the hats in front of them but not on . He eventually comes up with the solution of giving them a puzzle so if they succeed they can go free but if they fail they are executed. The first line gives the rover's position. corresponding to the x and y co-ordinates and the rover's orientation. and the second line is a series of instructions telling the rover how to explore the plateau.The first line of input is the upper-right coordinates of the plateau. He gives all four men party hats (as in diagram). The jailer puts three of the men sitting in a line. drawing in aspects of Game theory. The fourth man is put behind a screen (or in a separate room). OUTPUT: The output for each rover should be its final co-ordinates and heading. This puzzle comee under game theory. Generaly interview questions asked from math oriented. Each rover will be finished sequentially. Puzzle : Prisoners and three hats Four prisoners are arrested for a crime. The rest of the input is information pertaining to the rovers that have been deployed. which means that the second rover won't start to move until the first one has finished moving.0. The position is made up of two integers and a letter separated by spaces. The jailer explains that there are two red and two blue hats. Each rover has two lines of input. but the jail is full and the jailer has nowhere to put them. Companies expect that IT students have the backround knowledge of problem solving.
then C can say nothing. A sees B & C. can deduce that if C says nothing the hats on A and B must be different. and knowing what C would do. Puzzle : Prisoners and Four . Instead of two red and two blue hats there are 3 hats of one colour and only 1 hat of another. Thus B can see A (and his hat colour) and C can see A and B.e. Now the same puzzle with different condition. C would deduce that his own hat is the opposite colour. No communication between the men is allowed. The fourth man behind the screen can't see or be seen by any other prisoner. However. As like shown in diagram (D again not to be seen and only there to wear the last hat) . B sees A & C and C sees A & B. The solution For the sake of explanation let's label the prisoners in line order A B and C. and the 3 prisoners can see each other i. So if C observes that A and B have hats of the same colour. The prisoners know that there are only two hats of each colour.themselves or behind. (The fourth prisoner is irrelevant to the puzzle: his only purpose is to wear the fourth hat). The puzzle is to find how the prisoners can escape. Being able to see A's hat he can deduce his own hat colour. If any prisoner can figure out and say (out loud) to the jailer what colour hat he has on his head all four prisoners go free. after allowing an appropriate interval. The key is that prisoner B.hats. If A and B have hats of different colours.
They are told that there will be two black hats and three white hats. One hat is then put on each prisoner's head. C) wears the single off-colour hat. In second case. • If B wears a black hat as well. After a while. with A in front and C at the back. all four prisoners should be able to deduce that. thus the other two can easily deduce the colour of theirs. The first prisoner that is able to announce the colour of his hat correctly will be released. Another different condition. the three prisoners wear hats of the same colour. D must wear the off-colour hat.The solution There are two cases: In first case. No communication between the prisoners is allowed.hats. while D wears the off-colour hat. From this he concludes that his color is not single so he shouts his color. one of the three prisoners (in A. After some time. only A is able to announce (correctly) that his hat is white. only three prisoners and five hats (supposedly two black and three white) are involved. Why is that so? The solution Assuming that A wears a black hat. Puzzle : Prisoners and Five . For example if A is single color then B can see that C and A have different color hats. C can immediately tell that he is wearing a white hat after . since none of the others was able to state the colour of his own hat. The three prisoners are ordered to stand in a straight line facing the front. B. each prisoner can only see the hats of the people in front of him and not on his own's.
C will be unable to tell the colour of his hat (since there is a black and a white). This therefore proves that A must not be wearing a black hat. of breads remained are 3. When he went to bed he saw the thicker one is twice the length of the thinner one. 3rd. B can deduce from A's black hat and C's response that he (B) is not wearing a black hat (otherwise the above situation will happen) and is therefore wearing a white hat. • If B does not wear a black hat. Ramesh light the two candles at the same time. cards are of 4 colors.yellow. Initially how many breads were there? Answer : 31 Puzzle 4 : Two candles of equal lengths and of different thickness are there. conditions for arrangement: one red card must be in first row or second row. u have to arrange them in a 3*3 matrix. each loot a bakery one after the other such that the first one takes 1/2 of the total no.they are red. Answer : bdcae .4th and 5fth also did the same. The thinner 2 hours less than the thicker one. Answer : 3 hours Puzzle 5 : There are 5 persons who have won top 5 places in an event Olympics one of them asks all the 5 regarding their positions they reply as a: I am not the last b: c is in third place c: e is behind a d: b is in 1st place e: d is not the first find positions in order. The thicker one will last of six hours.blue. For how long did Ramesh lit two candles . At the end of the day u have 251 such scraps. Two blue cards must be in the 2nd row. For making one soap you will get 1 part as scrap. Puzzle 1 : 9 cards are there. From that how many soaps can be manufactured? Answer : 22 + 2+ 1 = 25.green.2 green cards should be in 3rd column. Hence. Yellow cards must be in the 3 corners only. Atleast one green card in each row. of the breads plus 1/2 of a bread.looking at the two black hats in front of him. After the fifth one no. Puzzle 3 : There are five thieves. Answer : Yello Red Blue Blue Yellow Green Green Green Yellow Puzzle 2 : In a soap company a soap is manufactured with 11 parts. Similarly 2nd.
Puzzle 8 : You are given a cake. Put it in the formula T=2 * 3. B. How will u cut the rest into Two equal parts? Answer : Slice the cake Puzzle 9 : What is the height of room if after entering the room with a watch ur head strikes a hanging bulb? Answer: Oscillate the hanging bulb. It means B is a liar then it means A and C are not of same type.Puzzle 6 : If one tyre of a car suddenly gets stolen…. C. one of its corner is broken. 1 from each tyre and fix the tyre. Puzzle 7 : How will you recognize the magnet & magnetic material & non-magnetic material? Answer : Drag one piece of material over another. If it iron bar then it moves freely and if it is magnetic bar then it fix in one direction according to poles.14 * (L/G)^1/2 L will be the length of the hanging thread. Calculate the time period for one complete oscillation by Simple Harmonic Motion (SHM) of the handing bulb. b) B says: A and C are of same type. The doctor was thinking that Boobie was a goofy name for parent's to choose. Answer : lets assume A is speaking truth. OR Get a piece of thread and tie up with the one bar and check for poles. biologist. Puzzle 12 : Ann. OR Drop it from the room and find the time at which it strikes the floor. Using physics formula s = (at^2)/2 (IM NOT SURE ABOUT THIS ONE) Puzzle 10 : Can u make 120 with 5 zeros? Answer : Factorial (factorial (0)+factorial (0)+factorial (0)+factorial (0)+factorial (0)) = 120 Puzzle 11 : There are three people A. Dave just told the biologist that Cathy was on her way with doughnuts. Liars are of same type and Truth speaking people are of same type. Their occupations are author. and after sometime u find the tyre without the screws how will u make ur journey complete? Answer : Open 3 screws. Find out who is speaking truth and who is speaking false from the following statements: a) A says: B is a liar.but didn't say anything. Cathy and Dave are at their monthly business meeting. but not necessarily in that order. What is each person's occupation? . chemist and doctor. Ann is sitting across from the doctor and next to the chemist. Boobie. There is no attractive force in the middle portion of the magnet. Add the L with ur height to get the height of the room.
Chess Board Puzzle : Imagine there are infinite number of Queens (Chess Game Piece) with u. The doctor didn't speak. Einstein's Riddle . No owners have the same pet.Answer: Since Dave spoke to the biologist and Ann sat next to the chemist and across the doctor. or drink the same beverage. of Queens on a chess board. In each house lives a person with a different nationality. smoke a certain brand of cigar. Hints: . but David did.Interview puzzles Einstein said that only 2% of the world could solve this problem. The 5 owners drink a certain type of beverage. and keep a certain pet. Answer : Indicates Queen. Find the minimum number of queens required so that every square grid on the chess board is under the attack of a queen. Arrange this minimum no. smoke the same brand of cigar. Cathy must be the author and Ann the biologist. There are 5 houses in 5 different colors. so Bobbie is the doctor and Dave the chemist.
· The Swede keeps dogs as pets. The images are given below. · The Norwegian lives in the first house.· The Brit lives in the red house. It shows the our identification based on the images. · The man living in the center house drinks milk. · The green house is on the left of the white house. · The person who smokes Pall Mall rears birds. · The Norwegian lives next to the blue house. 2. This is same as like the puzzles available in Image puzzles with Answers. · The green homeowner drinks coffee. 3. · The owner of the yellow house smokes Dunhill. · The German smokes prince. · The man who keeps the horse lives next to the man who smokes Dunhill. Who owns the fish? Image puzzles with Answers This puzzles are based on the images we need to find out the phrase. · The Dane drinks tea. . 1. · The owner who smokes Bluemaster drinks beer. · The man who smokes Blend lives next to the one who keeps cats. · The man who smokes Blend has a neighbor who drinks water.
Microsoft etc… Adobe Interview Puzzles : Weight Puzzle Puzzle 1 : (check this is already posted) . A) Ill in bed b) Safety in Numbers 5. Answers : 1. A) An outside chance b) Go for it 2.4. Adobe. A) I’m bigger than you b) Platinum 4. 5. A) Foreign Language b) Who’s in charge 3. A) Tip-toe through the tulips b) Alice in Wonderland c) Highway Overpass c) Neon Lights c) Break in Custom c) Read between the lines c) Merry go round The given puzzles are asked in many written exams conducted by varies IT companies like Google. yahoo. Amazon.
A3.ie in 3 weighings we can find out the odd ball.So answer is 3. Solution : This is a little trickier to solve.If A1 B2 B3 is lighter than B1 C1 C2 then the odd ball is among B2 and B3.B2.If A1 B2 B3 equal to B1 C1 C2 then odd ball is among A2 and A3.B2. Now let’s assume A's heavier than B's and we still don't know whether the odd is among A's or B's. We know A1 A2 A3 < B1 B2 B3 Now we compare A1 B2 B3 to B1 C1 C2 . From that only one odd ball being heavier or Lighter. Puzzle 2: This is same like the above weight puzzle But instead of 8 balls here You are given 13 balls. Solution: .Now its very easy as we can compare any of the normal ball with one of the 2 balls. If both weigh equal then the odd ball is among C1 and C2. The odd ball may be either heavier or lighter.Now weigh with A1. one of its corner is broken.Let us name the 8 balls as A1. question is to find out the minimum number of weighings required to spot the odd heavier ball among 8 identically looking balls using a common balance. Puzzle 3: You are given a cake.A3 on one side and B1.C1 and C2.Now we know that A's and B's are all normal ones we can weigh C1 with A1 and check whether C1 weighs the same as the normal ball. How will u cut the rest into Two equal parts? Solution : Slice the cake(Horigentally). In this way.A2. Now if the A1 B2 B3 is heavier than B1 C1 C2 Then it means the odd ball is among A1 and B1.B3. (inequalities are not allowed). Move 1 stick from the image below to make a valid equation.B3 on the other side.So we have zeroed down to 2 balls. Puzzle 4 : How it is possible to place four points that are equidistance from each other? Solution : place points in the shape of a pyramid. Find out the odd ball in 3 weightings. we can figure out in one weigh which of C1 and C2 is odd.A2. Now if A's weighed more than B's then we know for sure C's are normal ones.B1.There are 8 Balls available in a box.
That means 99 statements have to be incorrect and thus statement 99th is true If replaced by "at least".. 100-x are false. Statement n says "exactly n of the statements on this sheet are false." Which statements are true and which are false? What if we replace "exactly" by "at least"? Answer : In these 100 statements one and only one statement can be correct. We have learned that this paradox arises because of the false assumption that all statements are either true or false. Puzzle : A sheet of paper has statements numbered from 1 to 100. meaningless). suppose that there is one statement on the sheet and it says "One statement is false" or "At least one statement is false. ie. Anyone can easily understand and try to answer this puzzle.Hundred Numbers in a puzzle This is another one frequently asked puzzle in writtern test taken by IT companies. This is the hidden assumption in the above reasoning." either way it implies "this statement is false." which is a familiar paradoxical statement. . and the "real" number of false statements is x. x=100-x. If it is acknowledged that some of the statements on the page may be neither true nor false (i. then nothing whatsoever can be concluded about which statements are true or false. The first 50 statements are true. and statements 51 to 100 are false. there is a hidden and incorrect assumption in this argument.e. so x=50. then statements x+1 to 100 will be false (since they falsely claim that there are more false statements than there actually are). However. To see this. So. A simple logic is behind this puzzle try to find out.
By false 10. if 8 is true. thus 6 must be true. 420 has 22 different . which gives a paradox. as the number had to be a multiple of 6. 8) The unknown number equals the percentage of these statements which are true. that is a multiple of 3*4*5*7=420. 9) The number of different factors which the unknown number has (excluding 1 and itself) is more than the sum of the numbers of the true statements. 3) There exist three consecutive false statements. that is a multiple of 168 (by 7). 5 must be false. So we have either A) F X F X X T F T F F or B) F X T X X T T F F F In A).8 . so A) is out leaving us with B) Now. 2 and 4 must be true. then 3 is false (3 cannot be true when both 6 and 8 are true. as 2+3+4+5+6+7=27. So by 5 the number shall be either 27 (2+3+4+5+6+7) or 25 (3+4+5+6+7).6 and 7 are factors.6 and 7. A much more complicated version of the same problem is: 1) At least one of the last two statements in this list is true. either way 1 must be false. (by 7) 3. 6.This problem has been carefully contrived to appear to be solvable (like the vacuous statement "this statement is true"). though. 7) Each true statement's number is a factor of the unknown number. then 3 is true (8. 10) There are no three cosecutive true statements. the number must be a multiple of 42. and 2 may be true or false. 2) This is either the first true or the first false statement in the list. and then so must both 9 and 10. 4) The difference beween the numbers of the last true statement and the first true statement is a factor of the unknown number.7. if false. What is the number? The incorrect but plausible solution is: By 18.104.22.168. says "This is the last true statement".10 is false). 5) The sum of the numbers of the true statements is the unknown number. 4 and 5 must be true (by false 10). Now the number must be a multiple of 2.3. and less than 100 (by 8) If 8 is false. None of these can fullfill 8. and so must 7 and/or 8. 6) This is not the last true statement. then there are no three consecutive statements left). 7 and 8 cannot both be true. By changing the numbers in some statements and changing "true" to "false. that is 5 shall be a multiple of the number." various circular forms of the liar's paradox can be constructed.
140.factors (2. so the only multiple of 420 that fulfills false 9 is 422.214.171.124.210) 2+3+4+6+7 = 126.96.36.199.188.8.131.52.184.108.40.206.14. and the sum .220.127.116.11.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.