Skip to content

Cedar-Bailey#33

Open
beaniebaye wants to merge 3 commits intoAda-C16:masterfrom
beaniebaye:master
Open

Cedar-Bailey#33
beaniebaye wants to merge 3 commits intoAda-C16:masterfrom
beaniebaye:master

Conversation

@beaniebaye
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 implementation, Bailey. I'm marking this as a yellow as the time and space complexity is not filled out for this problem, and that's something we really want to check your understanding for in this project. If you would like a green score, feel free to resubmit with the Big O filled out.

Congrats on your offer! Let me know what questions you have.

🟡

Comment on lines 9 to 10
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?

Copy link
Author

Choose a reason for hiding this comment

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

WHOOPS! excuse me while go and check my other projects LOL

Choose a reason for hiding this comment

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

Thanks for updating 🤗

🟢


# dfs recursively

def dfs(node, group):

Choose a reason for hiding this comment

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

🐩 Really clean DFS implementation

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