News for hackers. Stuff that matters.
Re:Why we don't hire programmers based on puzzles and tricks by Jabbles on Friday February 22, 2013 @11:46AM (#5265151)
Anyone who's studied information theory would destroy that puzzle though. In the same way that someone with a physics degree would perform way above average on a "count the stars" question. Or someone whose dissertation was on computational biology would excel at a string-matching algorithm question.

It is an example of the interviewer (or company/process) mistaking a specific problem as representative of all problems. Presumably they're looking for someone with "general problem solving skills", rather than "knowledge of astrophysics".

Re:Why we don't hire programmers based on puzzles and tricks by pseut on Friday February 22, 2013 @12:21PM (#5265334)
You can interpret the response more broadly, though. In this case, it was probably pretty apparent that the person hadn't worked through the problem before, so it is indicative of problem-solving and attitude. If he'd recited the answer from memory that usually comes across and then you have to pick something from a different area. If, as an interviewer, you literally can't find a problem that the interviewee hasn't already thought about, (i.e., he or she knows about computational biology, astrophysics, information theory, etc and none of this was obvious from their resume and previous positions) that can also be a good sign.
Re:Why we don't hire programmers based on puzzles and tricks by achompas on Friday February 22, 2013 @03:26PM (#5266554)
It's easy to game your answer as an interviewee though. HN actually had a post a while back about someone who "interviewed" for a living while on unemployment; by the time he was done, he had mastered pretending to think deeply about the answer to any interviewing question.
Re:Why we don't hire programmers based on puzzles and tricks by pseut on Friday February 22, 2013 @04:23PM (#5266934)
It's possible, but I doubt it's easy. I assume that the "mastery" of thinking deeply about answering interview questions was self-reported, right? I'd be curious to know how many of the interviewers would agree with him about it.

This is something that's pretty easy to test out in practice interviews with friends. My experience is that it's a lot easier to come up with questions that require thought and insight to answer than it is to answer them.

Re:Why we don't hire programmers based on puzzles and tricks by dragonwriter on Tuesday February 26, 2013 @12:08PM (#5286833)
> Anyone who's studied information theory would destroy that puzzle though. In the same way that someone with a physics degree would perform way above average on a "count the stars" question. Or someone whose dissertation was on computational biology would excel at a string-matching algorithm question.

And...all of this is information the interview panel typically has available when evaluating candidates, as well as the result of any exercises done as part of the interview.

> It is an example of the interviewer (or company/process) mistaking a specific problem as representative of all problems. Presumably they're looking for someone with "general problem solving skills", rather than "knowledge of astrophysics".

If the process uses just one and not a set of exercises spread across problem domains, and gives it a fixed weight in the evaluation process and considers it independently of the candidates resume, the rest of the interview, etc., treating each component orthogonally rather than evaluating them together holistically, that might be true.

But that's not a problem with the puzzle as a tool, that's a problem with how the tool is used.

Re:Why we don't hire programmers based on puzzles and tricks by achompas on Friday February 22, 2013 @03:12PM (#5266471)
Anyone who's studied information theory would destroy that puzzle though.

I understand this comment in a general sense--the scale's behavior represents two possible states, so you can use it to filter the answer space in O(log_2 N) ala binary search, and you can get away with O[(log_2 N) - 1] if you partition the answer space the right way.

But what's the information theoretic interpretation of the problem?

Re:Why we don't hire programmers based on puzzles and tricks by mturmon on Friday February 22, 2013 @03:38PM (#5266620)
It is a source coding problem. Kind of like a Huffman code. Depending on how theoretical or applied your information theory coursework was, you might have worked out simple codes like these in class, and that might be an advantage.

It's actually very similar to your tree reasoning above. The information theoretic outlook uses the probabilities of each of the N states to make a more efficient code, but since there are no probabilities in this case, the two approaches pretty much coincide.

Incidentally, there are three possibilities with each weighing -- scale tips right, scale tips left, scale stays balanced. So your logs should be base 3. In coding language, you are transmitting ternary valued symbols.

And, you should dispense with the O() notation, because the lead constant matters very much in this puzzle, and it happens to be 1.

Re:Why we don't hire programmers based on puzzles and tricks by achompas on Friday February 22, 2013 @03:54PM (#5266722)
Thanks! Haven't taken a formal information theory class yet, but I'd like to soon.
Re:Why we don't hire programmers based on puzzles and tricks by mturmon on Friday February 22, 2013 @08:46PM (#5268135)
If you are mathematically inclined and good with probability, it could be a lot of fun.
Re:Why we don't hire programmers based on puzzles and tricks by rohamg on Friday February 22, 2013 @12:21PM (#5265338)
Everyone from McKinsey to Accenture makes the same mistake.