Pergunta de entrevista da empresa Adobe
They asked a graph problem based on Union Find (Disjoint Set Union), where I had to detect connected components and explain path compression and union by rank.
They asked a graph problem based on Union Find (Disjoint Set Union), where I had to detect connected components and explain path compression and union by rank.