Skip to content

Emily - Leaves #47

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

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

Emily - Leaves #47

wants to merge 2 commits into from

Conversation

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

Nice work, both methods work. See my notes on time complexity. Well done.

(1...length).each do |k|
if list[k] == list[k-1]
i = k
until i > length || list[i-1] == nil do

Choose a reason for hiding this comment

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

I would say until i >= length || list[i-1] == nil do

@@ -1,13 +1,45 @@

# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n^2)

Choose a reason for hiding this comment

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

Correct!

end

# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n), where n is total length of all strings combined

Choose a reason for hiding this comment

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

I would say O(n * m) where n is the number of strings and m is the number of letters in the average string. Unless the strings are small in which case you could say O(n)

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