Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Completed Graph-1 - #778

#778
Open
nitishred13 wants to merge 1 commit into
super30admin:mastersuper30admin/Graph-1:masterfrom
nitishred13:masternitishred13/Graph-1:masterCopy head branch name to clipboard
Open

Completed Graph-1#778
nitishred13 wants to merge 1 commit into
super30admin:mastersuper30admin/Graph-1:masterfrom
nitishred13:masternitishred13/Graph-1:masterCopy head branch name to clipboard

Conversation

@nitishred13

Copy link
Copy Markdown

No description provided.

@super30admin

Copy link
Copy Markdown
Owner
  • 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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants

Morty Proxy This is a proxified and sanitized view of the page, visit original site.