Re:Fast Crimes at Lambda School
by red_admiral on Wednesday June 19, 2024 @01:46PM
(#40730606)
Isn't the binary tree question more of a "low-pass filter"? As in, if someone can't even do that, they don't get as far as the interview where you talk about architecture and other cool things?
[ Parent
| on HN ]
Re:Fast Crimes at Lambda School
by kagakuninja on Wednesday June 19, 2024 @06:32PM
(#40733114)
I've been programming professionally for 35 years. I've never needed to invert or balance a tree. When I need a tree, there is usually a library that does what I need, and if not, I can google the algorithm that I need.
I could figure it out, but the issue is that it will take time, and it is stressful. A new college grad by contrast still remembers Data Structures 101, and how to manipulate trees. This kind of "bozo filter" favors both new grads, and people who spend a lot of time memorizing trivia in order to solve these problems quickly.
Yea, the real low pass filter is simply FizzBuzz or "Write a for loop." That will eliminate over 50% of your candidate funnel who literally don't know how to program. For a real candidate, it should take 30-90 seconds and you got it out of the way.
"Invert a binary tree" like questions just filter out anyone who hasn't recently graduated with a CS degree or recently and deliberately studied algorithms. I don't think they're that useful if you want to find a leader.