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.

Sign up for GitHub

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

Leaves - Morgan #42

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

Leaves - Morgan #42

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
a3ca6f8
finished first method
morganschuler Sep 17, 2019
8397e92
Updated method 2
morganschuler Sep 17, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 17 additions & 6 deletions lib/practice_exercises.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,13 +1,24 @@

# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n)
# Space Complexity: O(1)
Copy link

Choose a reason for hiding this comment

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

Since you are creating a new array the space complexity is O(n). This is also not in place.

def remove_duplicates(list)
raise NotImplementedError, "Not implemented yet"
new_array = []
list.each do |i|
unless new_array[-1] == i
new_array << i
end
end
return new_array
end

# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(n)
# Space Complexity: O(1)
def longest_prefix(strings)
Copy link

Choose a reason for hiding this comment

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

That works, very clever because it's finding the max and min strings alphabetically.

raise NotImplementedError, "Not implemented yet"
min = strings.min
max = strings.max
string_pre = min.size.times do |i|
break i if min[i] != max[i]
end
min[0...string_pre]
end