Algorithms
These days I am preparing for FAANG interviews. Therefore, revisiting ds/algo lectures like MIT 6.851 by Erik Demaine. And I am overwhelmed by the amount of content in any topic, especially related to algorithms. Lets say, strings - Pattern matching. Did you all study this much like Aho Corasick, suffix trays, trists and all to get the job at FAANG?
There is a post by Haseeb Qureshi on interview prep that lists all the topics. Just google it and you are all set.
Thanks for suggesting this.
Aho Corasick was genuinely useful on the job for me. But I don't think any interviewer would expect you to know about it.
Interesting , how was it helpful?
You don’t need to know suffix array/trees... but please know Trie and maybe kmp at most
From interviews the hardest DS that I was asked was a trie (FB). It should also be useful for you to know KMP or Z algorithm, it is simple and cool! Maybe you could also learn what is the purpose of other DS like suffix array, so you could fit it in some problem if it is a direct match or maybe assume that you have one and build a solution on top of the DS.
No. Use cracking the coding interview
Thank you. I use this book along with EPI.