Interviewing for a job at Google can be a nightmare experience. Reading about Google’s ridiculous interview questions, however, seems to be quite a lot of fun. Either that, or our readers are gluttons for punishment.[imgclear]

Earlier this month, we posted “15 Google Interview Questions That Will Make You Feel Stupid“, their answers and then 15 more questions. Three million pageviews later, here are…[imgclear]**Answers To 15 More Google Interview Questions That Will Make You Feel Stupid**

**Question:**

**Answer from reader Olivier Coudert:** The cheating husband problem is a classic recursion pb. Once all the wives know there is at least one cheating husband, we can understand the process recursively. Let’s assume that there is only one cheating husband. Then his wife doesn’t see anybody cheating, so she knows he cheats, and she will kill him that very day. If there are two cheating husband, their wives know of one cheating husband, and must wait one day before concluding that their own husbands cheat (since no husband got killed the day of the announcement). So with 100 cheating husbands, all life is good until 99 days later, when the 100 wives kill their unfaithful husbands all on the same day. Job: Product Manager. Photo: symmetry_mind

**Question:**

**Reader ru offers this answer:** The trick here is that .95 is the probability for 1 or more cars, not the probability of seeing just one car. The probability of NO cars in 30 minutes is 0.05, so the probability of no cars in 10 minutes is the cube root of that, so the probability of seeing a car in 10 minutes is one minus *that* or ~63 per cent Job: Product Manager

**Question:**

**Answer from an anonymous reader:** One and two across (two minutes); one goes back (three minutes); five and 10 go across (13 minutes); two goes back (15 minutes); one and two cross (17 minutes) — and everyone’s safe and sound. Job: Product Manager. Photo: Jule_Berlin

**Question:**

**Answer:** Ignoring seasonal upticks in births, there’s about 1/365 probability that any other person has the same birthday as you and 364/365 chance that any other random person does not. Do not take this bet. Job: Product Manager

**Question:**

**Answer from reader Matt Beauchamp:** 7.5 degrees. Every minute on the clock represents 6 degrees (360 degrees/60 minutes). Every hour, the hour hand moves from one number to the next (in this case, it is moving from 3 to 4) which represents 30 degrees. Since it is exactly 1/4 past the hour, the hour hand is 1/4 of the way into its 30-degree trip or 1/4 or 30 degrees… which is 7.5 degrees. Job: Product Manager

**Question:**

Since this question doesn’t say the sticks must intersect at their tips to form the triangle, the **answer** has to be 100 per cent. Any three sticks of any size can make a triangle. Job: Product Manager. Photo: markhillary[imgclear]

**Question:**

This is obviously an extremely vague question, and there isn’t really one correct **answer**. A good answer is one in which the interviewee demonstrates familiarity with the term “latency” and enough imagination to come up with an interesting problem with an interesting solution. Job: Product Manager Photo: warrenski

**Question:**

**Answer from reader Denis:** Three. Take any two of the points. Draw a line that is parallel to the line segment made by those two points and halfway between that line segment and the third point. Repeat for every combination of two points. Job: Software Engineer. Photo: Caveman 92223

**Question:**

1.84467441 × 1019 This is a pretty easy **answer** to figure out when you’re not sitting in an interview with no calculator around. Job: Software Engineer.[imgclear]

**Question:**

There’s no one **answer** to this. The interviewer wants to test the interviewee’s imagination and creativity with problem solving. We feel like reader “Dude” might impress a Google interview with this answer: Organise them according to types of clothes like a HASH and then organise each type into a 2-3-4-Tree or RedBlack Tree. Job: Software Engineer. Photo: Brymo

**Question:**

**Answer from reader Dude:** The data structure that is required is a two-character dimensional array. Call the function to check the six conditions if there are any winners, the sixth condition is to see if there are any more spaces left. If there is a winner the characters X or O are associated with the players, in this case you need a flag. If there is a winner return the value to the calling function to end the game. If not the run the game. Job: Software Engineer Photo: frozenchipmunk

**Question:**

Here’s another question without one **answer**. The idea is to test the interviewee’s creativity. We like the simple answer two readers came up with: Merge Sort for sorting. O(1,000,000,000,000 Log 1,000,000,000,000) — Average Case Scenario; O(1,000,000,000,000 Log 1,000,000,000,000) — Worst Case Scenario. I’d guess you can do one billion operations per second, thus 3000 seconds. Job: Software Engineer

**Question:**

The object of the game is to direct a frog to avoid cars while crossing a busy road. You may represent a road lane via an array. Generalise the solution for an N-lane road. Here’s the only **answer **we found for this one, from site Glassdoor.com: “One approach is to write a recursive algorithm that determines when to ‘wait’ or to ‘jump’ to the next lane, depending if there is an approaching obstacle in the next lane.” Job: Software Engineer

**Question:**

This is another question that’s about testing the job candidate’s ability to frame the problem in a simple way and then creatively solve it. Our **answer**: A candiate for Quantitative Compensation Analyst should know that Google hired about 3400 people in 2008. Figure 75 per cent (or 2550) of those hired were engineers and that, like Harvard, Google only accepted 3 per cent of those who applied. 2550 is 3 per cent of 85,000. Job: Quantitative Compensation Analyst

**Question:**

**Here’s our favourite answer from reader “dude”:** Create temporary pointers and start from the root. (Most of the time circular lists have front and back pointers.) Check if front is larger or if back is larger. If front is larger then you know you are at the end of the list and at the front of the list. If front is larger then traverse the opposite direction and compare numbers. If there is no root or a pointer pointing to any part of the list then your data is lost in memory. Job: Quantitative Compensation Analyst