Domanda di colloquio di Google

Trie tree string search and one dynamic programming

Risposte di colloquio

Anonimo

24 gen 2021

It's essential to demonstrate that you can really go deep... there are plenty of followup questions and (sometimes tangential) angles to explore. There's a lot of Software Engineer New Grad experts who've worked at Google, who provide this sort of practice through mock interviews. There's a whole list of them curated on Prepfully. prepfully.com/practice-interviews

Anonimo

21 dic 2020

Trie tree is not able to have a solution. I don't know the structure at all. For dynamic programming, I use dfs with memory.