Atlassian SDE Interview Question 2022 April | Graphs (Dynamic Union-Find) | Off-Campus

Question 1: Find All People With Secret Problem Statement You are given an integer n indicating there are n people numbered from 0 to n - 1. You are also given a 0-indexed 2D integer array meetings where meetings[i] = [x_i, y_i, time_i] indicates that person x_i and person y_i have a meeting at time_i. Person 0 has a secret and initially shares the secret with a person firstPerson at time 0. This secret is then shared every time a ...