Pregunta de entrevista de IXL Learning

K largest elements, topological sort, greedy algorithm