7 ms·
Impressive, but you probably see it as well as everyone else that every problem domain on your list is connected with particular set of well-known algorighms. T
by lafar6502 12y ago
Impressive, but you probably see it as well as everyone else that every problem domain on your list is connected with particular set of well-known algorighms. There are no 'algorithms in the wild' - they always solve some problem.. So, i don't see any clear difference between geeking about a hashtable vs geeking about some compilation step. The key word here is 'geeking' vs 'not being interested at all how that stuff works'.
- eli_gottlieb 12y ago>There are no 'algorithms in the wild' - they always solve some problem.. Interestingly, this isn't true. I have done worse than I can in interview cycles because I tend to go into them without having studied "Cracking the Coding Interview" or my old algorithms textbook, and thus do strictly worse at the algorithms-and-data-structures hey-let's-talk-about-asymptotic-performance-bounds quiz questions given in interviews.