http://www.huffingtonpost.com/2010/12/30/job-interview-questions_n_802658.html#s217038&title=Goldman%20Sachs%20-%20Analyst%20position%20
1/1/2011 10:54:53 PM
Not wasting time on this.
1/1/2011 10:57:26 PM
I'm gonna be so fucked
1/1/2011 11:03:59 PM
What if I already have inherited a pizzeria from my uncle? There is a reason I'm applying for a job
1/1/2011 11:06:52 PM
these are all asinine questions that tell the interviewer nothing about how well someone might perform in a job. some of them, however, are pretty interesting as riddles go.
1/1/2011 11:07:15 PM
It would suck to be shrunk down to pencil size and placed in a blender.
1/1/2011 11:08:03 PM
1/1/2011 11:11:52 PM
How do you answer that in a professional way anyway? Cuz my answer would be to ninja climb my ass out. Blender walls are close enough together to pull that off I thinkShit is gonna bother me until I get home and can compare pencil to blender sizes[Edited on January 1, 2011 at 11:16 PM. Reason : stupid phone]
1/1/2011 11:12:46 PM
i think these are perfectly fine questions to ask during an interviewthey give the interviewer a chance to see how the applicant handles a curveball
1/1/2011 11:14:54 PM
i've been in a couple of interviews with questions like this, one w/ schlumberger, one with a local company
1/1/2011 11:15:58 PM
Thread destroyed. Nice!I saw that.
1/1/2011 11:16:25 PM
I answered them all correct and just got offered a job making 150k.
1/1/2011 11:18:05 PM
[quote]Lindsey Gregory 2 hours ago (9:10 PM)“What do wood and alcohol have in common?”Both + lighter = fire.geniusxboy 0 minute ago (11:17 PM)0 FansThis comment is pending approval and won't be displayed until it is approved.“What do wood and alcohol have in common?”It's "Grain."Wood Grainand Grain Alcohol
1/1/2011 11:21:37 PM
1/1/2011 11:27:15 PM
what's the minimum number of guesses to guess anything...
1/1/2011 11:34:05 PM
I thought they are asking what the minimum number of guesses it would take to guess a correct number if you guess and got it wrong until there were no numbers left to choose from
1/1/2011 11:36:52 PM
1/1/2011 11:40:52 PM
1/1/2011 11:45:56 PM
1/1/2011 11:46:50 PM
1/1/2011 11:51:43 PM
^Why do you need to race them a second time? Answer: you don't. Compare their fucking times.
1/1/2011 11:53:02 PM
Same reason why some teams go to the superbowl who have lost to a team that was not in the superbowl.
1/1/2011 11:54:41 PM
^^^^ you label all 3 boxes as "fruit".
1/1/2011 11:56:36 PM
^^^^ What if the fastest 3 horses are in the same heat, you would instantly knock out #2 and #3 that way.[Edited on January 2, 2011 at 12:08 AM. Reason : ^]
1/2/2011 12:07:55 AM
good call.
1/2/2011 12:10:06 AM
^^^
1/2/2011 12:15:19 AM
It's not exactly Newton's Method, but you have the right idea; in general it's ceil(lg(n)), where n is the size of the initial set to guess from, lg is the base-2 logarithm, and ceil is the ceiling function, a.k.a. "rounding up"; for this case a reasonable algorithm can be given (choose either the middle integer in the set or the even integer out of the two middle ones, and then the new set is based on whether you hear "higher" or "lower") and then the worst cases are the odd numbers 751-781 and 845-875.I enjoyed the question about horse-racing, and I believe the answer is "7" (of course, if you could actually time them instead of merely seeing the rankings, it's "5"): Separate the horses into 5 groups A-E and race them in first-tier races; label them A1, B3, etc. based on the group and position in the first race. Then race all of the first-place finishers in a second-tier race to determine the fastest horse overall (imagine the first three were C1, E1, and A1); finally, set up a race involving the second- and third-place finishers in the second-tier race, the second-place finisher in the first-tier race in which the second-place finisher in the second-tier race had won, and the second- and third-place finishers in the first-tier race won by the fastest horse, to determine the second- and third-fastest horses overall (in this imagination, the final race would involve E1, A1, E2, C2, and C3, respectively; either E1 or C2 is definitely the second-fastest, and the third-fastest could be either of them or A1, E2, or C3).
1/2/2011 12:28:22 AM
nvmbut I'd land a job on wall street, no sweat.[Edited on January 2, 2011 at 12:37 AM. Reason : too bad living in NY isn't what I want atm]
1/2/2011 12:36:43 AM
1/2/2011 12:40:07 AM
degrading track conditions and tired horses will make them run differently.
1/2/2011 12:54:50 AM
1/2/2011 12:57:22 AM
They are carbohydrates, and the latter can be derived from the former (albeit in a form unsafe for drinking).
1/2/2011 1:36:05 AM
^^hahahah
1/2/2011 1:47:36 AM
1/2/2011 2:16:09 AM
Why would it be 0? I have already demonstrated that 7 are needed to determine the fastest 3 horses.
1/2/2011 2:32:21 AM
You're assuming this is a math puzzle and I'm assuming that it is (or at least could be) a reading comprehension test.
1/2/2011 2:48:53 AM
1/2/2011 10:39:20 AM
max would be 1000the only way that equation or yalls theory would be the answer would be "what is the most efficient way to find the number"
1/2/2011 10:41:26 AM
^ I don't think you understand the question. theres no way the max is 1000
1/2/2011 10:43:08 AM
if you guessed every other number before you got it right it would be 1000if you guessed it right on the first try it would be 1what is there not to understand?
1/2/2011 10:45:22 AM
1/2/2011 10:45:39 AM
1/2/2011 10:51:24 AM
if it is 1000 and you start at 1 and go up, it could still be 1000I didn't say it was the most logical (but it is the maximum)
1/2/2011 10:52:12 AM
As for the blender question, I would crawl into the bottom and tear pieces of the rubber ring apart, and then strap them to my feet and hands as suction cups and then scale the wall to get out.
1/2/2011 11:08:15 AM
^^ you're totally ignoring the 'higher' and 'lower' hints. reading is fundamental.^ it says you'd be shrunk to the 'size' of a pencil...not that your feet would turn into erasers or something
1/2/2011 11:40:50 AM
^He said "the rubber ring" as in part of the blender...but you can't rely on being able to fashion suction cups from the pieces; I'd just climb out, remember that it is possible for people to grip any surface of a blender, and I would be very strong in comparison to my size, by the Square-Cube Law: http://tvtropes.org/pmwiki/pmwiki.php/Main/SquareCubeLaw
1/2/2011 12:00:37 PM
1/2/2011 12:10:31 PM
1/2/2011 12:24:35 PM
at lot of these are discrete math problems and have been answered very wrong. I also get the impression they've been truncated by some "journalist" that doesn't understand how minute details have profound effects on these problems and doesn't understand most of them.the facebook question about the 1-1000 guess is supposed to be a binary search question though the minimum of any value matching search is 1 since your answer could be first in memory/guessed first/etcthe 25 horses problem isn't as simple as it seems as you could have a bracket of 5 horses that contains the fastest 3. so after the first 5 races, you can only eliminate the bottom 2 from each race, leaving 15. run the top 15 in 3 races and you can again only eliminate the bottom 2 so you're left with 11. then you have 2 races with 5 eliminating 4 more leaving you with 7. and then 2 more races to eliminate the final 4. the answer is 12 races ASSuming you have no time keeping device. with a time keeping device this is stupid and you only need 5. I didn't read all of them
1/2/2011 12:34:27 PM
^Do you need me to draw a diagram to show why you only need 7 races?
1/2/2011 12:58:59 PM