As we all probably know that Google asks quiet a lot of questions on strings and graph. I am not strong enough in strings related problems, be it substring or pattern matching. I came across multiple advanced data structures for even finding LCA problem like suffix tree, suffix array.
For example, suffix array is powerful to solve the following problems like pattern searching, Finding longest repeated substring, finding longest palindrome in a string, lowest common ancestors, finding the longest common substring, exact string matching.

So, to all Googlers, my question is - is it really required to know and be so comfortable with the advanced data structures and advanced algorithms to crack the Google interview? A problem can be solved in multiple ways. But to solve it most efficiently, do I need to master those data structures?

Thanks in advance!