News for hackers. Stuff that matters.
Re:Data Structure and Algorithms Interview Questions for Pro... by EZ-E on Thursday November 15, 2018 @12:59AM (#18457218)
If you ask in-depth questions about their past projects, the challenges they faced, the decisions they had to take, I think it's very possible to find out whether they were major parts of it, or if just small code-pushers who just implemented things like they were told.
Re:Data Structure and Algorithms Interview Questions for Pro... by denormalfloat on Thursday November 15, 2018 @01:20AM (#18457288)
This would likely result in interviewer bias based on how familiar they are with the project the candidate was working on. How do I fairly compare 10 candidates based on their answer to that question? The interview questions need to be objective and have a clear right answer. If you interview regularly (and work directly with the people you hire), I think the problem with your approach will become obvious.
Re:Data Structure and Algorithms Interview Questions for Pro... by EZ-E on Thursday November 15, 2018 @01:25AM (#18457310)
> The interview questions need to be objective and have a clear right answer

Then it's a test, not an interview. I don't think interviews were ever supposed to be perfectly objective. If the interview is only based on CS textbook questions, they might as well replace the interviewer with an online test, which by the way increasingly happens for screening, but my point is that it filters out great engineers who worked and delivered solid products because the interviewers are just not interested in details of past work experience

Re:Data Structure and Algorithms Interview Questions for Pro... by denormalfloat on Thursday November 15, 2018 @01:41AM (#18457372)
> but my point is that it filters out great engineers who worked and delivered solid products because the interviewers are just not interested in details of past work experience

Again, yes. It is hard to fire a bad candidate in case the interview was misleading. Companies would prefer false negatives over false positives. What you see in interviews is a product of laws about hiring and firing.

Re:Data Structure and Algorithms Interview Questions for Pro... by wolfgke on Thursday November 15, 2018 @07:31AM (#18458708)
> Companies would prefer false negatives over false positives.

If this is the case (i.e. companies can afford this behavior), all the claims about skill shortage are a lie and should be called out.

Re:Data Structure and Algorithms Interview Questions for Pro... by YorkshireSeason on Thursday November 15, 2018 @05:21AM (#18458201)

   in-depth questions 
That is true, but time-consuming, and not objective. How, for example, would you evaluate whether they tell you the truth about their past project? If you have to interview a large number of people and need to make decisions effectively, that's a disadvantage.
Re:Data Structure and Algorithms Interview Questions for Pro... by jimjansen1 on Thursday November 15, 2018 @10:16AM (#18459851)
> How, for example, would you evaluate whether they tell you the truth about their past project?

How is that any better than hiring a terrible dev that just spent 3 months memorizing Leetcode solutions? Aren't they essentially being dishonest about their skills?

>time-consuming Phone screens are already several hours over several days and on-sites are typically 8 hour affairs. Is this not already time consuming?

Genuinely confused by the Stockholm Syndrome-like mindset that devs have for Whiteboard interviews.

Re:Data Structure and Algorithms Interview Questions for Pro... by YorkshireSeason on Thursday November 15, 2018 @10:53AM (#18460210)

   memorizing Leetcode solutions
Are the hard Leetcode questions rote memorable?

I have my doubts. Indeed from my own experience with Leetcode is I can only do well on the questions that I think quite hard about. Recently I tried to do a Leetcode question marked Medium, but my 3 line solution (while correct, and working on my own test cases) always resulted in "Time Limit Exceeded". I studied their test cases, and realised that my brute-force solution was of exponential time complexity. I then read of the discussion of the problem, was so delighted with, and surprised by one of the proposed solutions (linear time) that I felt compelled to write down the loop invariant in Hoare logic! Fun evening, and I'll never forget this neat algorithmic trick. I think that practising enough Leetcode so as to do well on the Medium/Hard questions requires developing an understanding of algorithms which is highly useful in practise, in particular, if you work with large data sets, clever algorithms are unavoidable for getting anything done. Have a look at the list of past ACM coding contest winners, e.g. the 1993 winners [1] include Craig Silverstein (first hire at Google) and Tony Hsieh (Zappos, LinkEchange).

Summary: I don't believe that doing 3 months coding challenges is meaningfully described as memorisation.

On top of that, doing coding challenges is perfectly compatible with asking other questions.

[1] https://icpc.baylor.edu/community/history-icpc-1993

Re:Data Structure and Algorithms Interview Questions for Pro... by jimjansen1 on Thursday November 15, 2018 @01:00PM (#18461584)
I think you misunderstood. It's certainly possible to learn a lot by doing Leetcode. I'm saying that since solutions are available to their problems that you could simply memorize as many of them as you can and would probably pass most whiteboard interviews with memorized optimal solutions