3 ms·
In case of sorting algorithm, it is important to know the trade-off. However, precisely knowing the details e.g. knowing the details of deleting a node from a b
by xfer 9y ago
In case of sorting algorithm, it is important to know the trade-off. However, precisely knowing the details e.g. knowing the details of deleting a node from a balanced tree, is not really useful and that is exactly what is needed to pass whiteboard tests.
In most cases(in my experience), i can always lookup details of some algorithm when i need it. Admittedly, my job doesn't require me to design algorithms, but implement some not so readily available ones sometimes.
- walshemj 9y agowhich is quite right at my first job we didn't get our very expensive engineers (Oh rate was > 500%) to write our own fourier analysis we just brought one from NAG.
- gameswithgo 9y agoFor sure, I'm not arguing that some whiteboard interview questions aren't crazy, i realize there are. But also I'm not sure how common it is to have interview questions such as "delete a node from a balanced tree" where they actually expect you to get that right vs just see if you get the basic idea. I've never run into it. Perhaps many people on hackernews work in silicon valley and that is more common there.