Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Earth - Jasmine #11

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Earth - Jasmine #11

wants to merge 1 commit into from

Conversation

jasyl
Copy link

@jasyl jasyl commented Jun 15, 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 recursive DFS solution. Well done!

Comment on lines +2 to 4
# Time complexity: O(V + E), where V is the number of vertices and E is the number of adjecent neighbors.
# Space complexity: O(V) where v is the number of vertices/dogs because of the dog_group array. The recursive stack will be at most O(n), as well.
def possible_bipartition(dislikes)

Choose a reason for hiding this comment

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

👍

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