-
Notifications
You must be signed in to change notification settings - Fork 0
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
Create merge_tools.py #152
Open
madhuri7112
wants to merge
1
commit into
master
Choose a base branch
from
Mydhili
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 |
---|---|---|
@@ -0,0 +1,21 @@ | ||
def merge_the_tools(string, k): | ||
#divide string into k length substrings | ||
x = 0 | ||
y = k | ||
subStrs = [] | ||
while (y <= len(string)): | ||
subStrs.append(string[x:y]) | ||
x += k | ||
y += k | ||
|
||
#remove duplicates in each and print each | ||
for subStr in subStrs: | ||
print remove_dups(subStr) | ||
|
||
def remove_dups(string): | ||
newstr = [] | ||
for i in range(len(string)): | ||
if string[i] not in string[:i]: | ||
newstr.append(string[i]) | ||
newstr1 = "" | ||
return newstr1.join(newstr) |
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.
You are iterating through the entire string until ith character for every character so the time complexity of this loop is O(n^2) which is not ideal.
Instead, you can use a set to do this
The time complexity of this loop is only O(n) because it iterates through the string only once and look up in set is O(1) time operation.