Skip to content

Conversation

@OhCloud
Copy link

@OhCloud OhCloud commented Oct 12, 2019

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 work Cloudy, take a look at my comments and let me know where you have questions. You hit the learning goals here. Well done!


# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: OofNsquared bc delete_at takes up ALOT of space (so says my tutor)

Choose a reason for hiding this comment

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

Not space, but time, I understand what you're getting at.

# Time Complexity: ?
# Space Complexity: ?
#hi chris, this one boggled my mind, dont mind my notes.
# Time Complexity: OofNsquared *maybe?

Choose a reason for hiding this comment

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

That's a good idea, it's O(n * m) where n is the number of strings and m is the length of the strings.

# Space Complexity: ?
#hi chris, this one boggled my mind, dont mind my notes.
# Time Complexity: OofNsquared *maybe?
# Space Complexity: OofN

Choose a reason for hiding this comment

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

It's probably simpler just to put O(n) ok?

You're right where n is the number of letters in a string.

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