Skip to content

all tests passing#25

Open
FaithKauwe wants to merge 1 commit intoAda-C16:masterfrom
FaithKauwe:master
Open

all tests passing#25
FaithKauwe wants to merge 1 commit intoAda-C16:masterfrom
FaithKauwe:master

Conversation

@FaithKauwe
Copy link

No description provided.

Copy link

@kyra-patton kyra-patton 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, Faith. I left a couple comments on time complexity and edge cases, but overall a very clean BFS solution. Let me know what questions you have.

🟢

into the same partition.
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(n)

Choose a reason for hiding this comment

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

⏱ Time complexity will actually be O(N + E) where N is the number of nodes/dogs in dislikes and E is the number of edges or dislikes between two dogs. You loop through all of the nodes, then each of the nodes' edges.

Comment on lines +23 to +26
if dislikes[0]:
start = 0
else:
start = 1

Choose a reason for hiding this comment

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

What if there are multiple dogs at the beginning of dislikes that don't dislike any other dogs (are disconnected from the rest of the graph)? How might you account for this edge case?

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