Now this is a simple problem for anyone who has taken any DS or Algo Undergraduate level class since it involves the important concept of the priority queue. However, it is my understanding that to do this in a linear time is neither trivial nor straightforward and unless that person is really gifted. (Its something called Monotone Priority Queue which is not present in any standard Algorithm textbook) So my question to the general populace is: Are knowing obscure algorithms like this any test of a person's programming ability ?
Ask HN: Is asking obscure algorithms any test of programming ability?
1–10 of 43 posts
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#2Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#3The test isn't about whether you know the algorithm – quite the opposite. The test is about seeing how you approach a problem you haven't (possibly) solved before.
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#4The test isn't about whether you know the algorithm – quite the opposite. The test is about seeing how you approach a problem you haven't (possibly) solved before.
There are rumors that unless you are spot on perfect in Big 4 interviews, they wont advance you.
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#5The test isn't about whether you know the algorithm – quite the opposite. The test is about seeing how you approach a problem you haven't (possibly) solved before.
That's an interesting observation. So what you are saying is that if I make sufficient headway into the problem without providing the most efficient answer, it should be fine? There are rumors that unless you are spot on perfect in Big 4 interviews, they wont advance you.
It's about understanding the computer science fundamentals in order to keep your code from burning up 1000's of cores due to asymptotically-poor characteristics.
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#6The test isn't about whether you know the algorithm – quite the opposite. The test is about seeing how you approach a problem you haven't (possibly) solved before.
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#7The test isn't about whether you know the algorithm – quite the opposite. The test is about seeing how you approach a problem you haven't (possibly) solved before.
That's an interesting observation. So what you are saying is that if I make sufficient headway into the problem without providing the most efficient answer, it should be fine? There are rumors that unless you are spot on perfect in Big 4 interviews, they wont advance you.
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#8Problem with Big 4 is that these problems are on such scale that you cannot possibly expect anyone knowing how to solve them. In the same sense your experience is irrelevant because these companies have internal tooling and frameworks that are mostly specific to problem domain.
Algorithms questions test two things: 1. How you think under pressure. (culture fit) 2. Dedication, because you need to waste weeks on preparations (corporate slave).
Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#9Re: Ask HN: Is asking obscure algorithms any test of programming ability?
#10If you believe some reports, it doesn't matter what is covered in an interview; it's no better than a lottery regardless.
Or it could be a mistake, and it was just bad luck that your friend got an interviewer who doesn't know how to interview, and asked a question that about a subject that they're intimately familiar with, but is too hard compared to what is asked by other interviewers.