3 ms·
I'm also curious as to what level of student this targets. Would this be good for brushing up on my sorts and data structures for my interviews, for example?
by sbuccini 12y ago
I'm also curious as to what level of student this targets. Would this be good for brushing up on my sorts and data structures for my interviews, for example?
- idle_processor 12y agoSteve Yegge (Amazon, Google) of Stevey's Blog Rants seemed to think so. > My absolute favorite for this kind of interview preparation is Steven Skiena's The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace (and important) graph problems are – they should be part of every working programmer's toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. But the gold mine is the second half of the book, which is a sort of encyclopedia of 1-pagers on zillions of useful problems and various ways to solve them, without too much detail. Almost every 1-pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types. Source: http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html http://steve-yegge.blogspot.com/2008/03/get-that-job-at-goog...
- joshvm 12y agoA friend of mine was applying to various large tech companies and recommended Programming Interviews Exposed (Mongan). It's got good coverage of standard interview algorithms as well as broader topics like concurrency, oop, databases and tech-specific interview prep. He didn't get the job at Google unfortunately, but he did get a job in ESA's flight dynamics team which I think is far cooler.
- PublicEnemy111 12y agoIf you're looking for a comprehensive review including both intuition and theory, I'd be remiss if I didn't recommend CLRS(http://mitpress.mit.edu/books/introduction-algorithms http://mitpress.mit.edu/books/introduction-algorithms) I personally believe understanding intuition and theory are more important than simply being able to recite an algorithms implementation.