Hacker News Reader

If you're interested in Data Structures classes, I also strongly recommend Keith Schwartz's CS166. Unfortunately there are no public video recordings afaik, but slides and handouts are available, and also of exceptional quality: http://web.stanford.edu/class/archive/cs/cs166/cs166.1196/

View on HN

That is a nice set of materials, can confirm. I loved the range-minimum-query parts, amongst others.

RMQ is cool because there's a bunch of different approaches, there's different tradeoffs to make (time, memory, implementation effort, pratical and theoretical efficiency, etc.), and some of the results are surprising.

Nice link. I've been learning more about string processing for search via research papers, but began with Suffix Trees. I just started looking at the slides here and looks easily digestible: http://web.stanford.edu/class/archive/cs/cs166/cs166.1196/le...

Reply on news.ycombinator.com