Given timestamped friendship events among N people, determine the earliest time when the social graph becomes fully connected; process events in chronological order and use a union-find (DSU) to merge components, returning the timestamp when the component count becomes one or -1 if it never does.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Find the earliest timestamp when all become friends with add and remove friend operations. Two types of logs: Add Friend (A and B become friends) and Remove Friend (If A and B are friends, unfriend them). Two people can be connected and disconnected multiple times.
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
