Skip to content

Conversation

@julianadecarvalho
Copy link

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.

Nicely done Juliana, very compact and nicely written. Well done.

Comment on lines 5 to 10
""" Will return True or False if the given graph
can be bipartitioned without neighboring nodes put
into the same partition.
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(N + E)
Space Complexity: O(n)
"""

Choose a reason for hiding this comment

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

👍 Nice BFS implementation!

for i in range(N):
if dogs[i] != None:
continue
queued.append((i, "Baker"))

Choose a reason for hiding this comment

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

Baker & Jpug?

Just curious

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