Domanda di colloquio di Google

data structures and algorithms, optimizating your solution (n2 -> n log n -> n), 5-6 leetcode medium / 1-2 hard. be prepared for non-stop 45 minutes of coding, barely any time for you to ask questions that aren't about the problem