Pregunta de entrevista de Google

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

Respuesta de la entrevista

Anónimo

31 dic 2019

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