In this problem, we are given a set of persons and meetings between people at fixed time, some people know a secret and they are revealing it at each of their meeting. When a person knows a secret, they will reveal it at each of their subsequent meetings. We need to return the set of persons who know the secret at the end of all meetings.
You are given an integer
nindicating there are
npeople numbered from
n - 1. You are also given a 0-indexed 2D integer array
meetings[i] = [xi, yi, timei]indicates that person