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

Rock - Juliana's Solution. All tests passing. #19

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

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