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

Lety Palomo -Pine C-16 Graphs #29

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Conversation

letypl12
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.

🐾🐶 Your implementation works, but you forgot to add the time and space complexity.

Since the time and space complexity of BFS is a bit different from past functions you may have implemented, we do consider it an essential component to completing this project. Feel free to update your project with the Big O filled out for a green score. Let me know what questions you have.

🟡

Comment on lines 8 to 9
Time Complexity: ?
Space Complexity: ?

Choose a reason for hiding this comment

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

⏱🪐 Time and space complexity?

dog_q=deque()
for i in range (len(dislikes)):
if i not in grouped:
dog_q += [i]

Choose a reason for hiding this comment

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

🤔 I'm not exactly sure why you are adding i as a list to the queue. It should be sufficient to just add i

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