Completed Graph-1

[nitishred13]

No description provided.

[super30admin]

• The student's solution is excellent and correctly solves the problem. The implementation is efficient and matches the reference solution in both time and space complexity.
• The code is clean and easy to understand, with good use of variable names and clear logic.
• One minor suggestion: The comment "Time Complexity: O(n)" could be more precise. It should be O(E + V) where E is the number of trust relationships and V is the number of people, as the solution iterates through all trust relationships and then all people.