Domanda di colloquio di Google

Graph problem with something about DFS and a bit of dynamic programming

Risposta di colloquio

Anonimo

31 dic 2019

Correct implementation (variation of topsort) and correct run time + space complexity.