One of the problems that I have with this list is some of the stuff I just haven't had to deal with since college, like implementing all those data-structures like bubble sorts//binary search, linked lists, etc...In 15 years, I've never had to implement one (when I was a C/C++ coder in the '90s, we used 3rd party libraries like Dinkumware). Interviews that ask these type of questions are really skewed at hiring young…
What you're claiming is a straw man of the processes I've personally seen. In most good interviews they ask you something specific to implement, such as how do you implement a code complete feature in an IDE or an event logger. There will be some obvious naive solution that would be slow with any reasonable amount of data. They want to see if you can use the data structures in practical way. The expectation is that i…
But I will say, as never having used a graph search like Dijkstra's in any of my work, the idea of studying this to take a hiring test still goes with my theory of learning something by rote. If someday I need to implement the concept, or use it, I'm sure I'll go figure it out. I had to do this awhile ago with a Levenshtein distance for computing similar string matching. Had someone asked me in an interview, I'd have completely failed at it.