This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Firms love to force candidates to go through bizarre humiliation rituals during interviews. One of these was to implement a topsort algo for their autograd engine. If we consider a computation graph where each node represents a variable and each edge represents a dependency, the goal of this algorithm is to sort the nodes in “ topological order ”, i.e. such that if there is an edge from node \(u\)…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.