Question d’entretien chez IXL Learning

K largest elements, topological sort, greedy algorithm