Skip to content

Conversation

@arigo7
Copy link

@arigo7 arigo7 commented Nov 17, 2021

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Ari, this is a nice BFS solution. Well done.

Comment on lines +9 to +10
Time Complexity: O(nm)
Space Complexity: O(n)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You need to elaborate on what m is. I get that n is the number of nodes.

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.

2 participants