Google interview question
Graph problem with something about DFS and a bit of dynamic programming
Interview Answer
Anonymous
Dec 31, 2019
Correct implementation (variation of topsort) and correct run time + space complexity.
Graph problem with something about DFS and a bit of dynamic programming
Anonymous
Correct implementation (variation of topsort) and correct run time + space complexity.
Check out your Company Bowl for anonymous work chats.