forked from AdaGold/array-string-practice
-
Notifications
You must be signed in to change notification settings - Fork 49
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
Branches - Linnea #49
Open
llinneaa
wants to merge
1
commit into
Ada-C12:master
Choose a base branch
from
llinneaa:master
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,13 +1,37 @@ | ||
|
||
# Time Complexity: ? | ||
# Space Complexity: ? | ||
require 'pry' | ||
# Time Complexity: O(n) | ||
# Space Complexity: O(n) | ||
def remove_duplicates(list) | ||
raise NotImplementedError, "Not implemented yet" | ||
len = list.length | ||
if len == 1 || len == 0 | ||
return list | ||
end | ||
|
||
new_list = [] | ||
(0..len-1).each do |i| | ||
if list[i] != i | ||
new_list << list[i] | ||
end | ||
end | ||
return new_list | ||
end | ||
|
||
# Time Complexity: ? | ||
# Space Complexity: ? | ||
# Time Complexity: O(n^2) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. This is actually O(nm) where m is the length of the shortest word. |
||
# Space Complexity: O(n) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Given the above space complexity is O(m) |
||
def longest_prefix(strings) | ||
raise NotImplementedError, "Not implemented yet" | ||
end | ||
|
||
result = "" | ||
i = 0 | ||
|
||
strings[0].each_char do |letter| | ||
strings.each do |string| | ||
if letter != string[i] | ||
return result | ||
end | ||
end | ||
|
||
result += letter | ||
i += 1 | ||
end | ||
return result | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is only not adding elements if they are not equal to their index, which won't work in all cases.
Consider: