|
|
|
|
|
|
by Spoom
3141 days ago
|
|
|
Interviewed at Google, this is spot on. You need to know arrays, trees, graphs, stacks, queues, at least two sorts (I suggest mergesort and quicksort), dynamic programming, greedy optimization, and big O cold at an absolute minimum. I'm sure I'm missing some stuff. They tell you all this in the "secret" onsite prep website. |
|
|