Skip to content

init commit #1

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

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

init commit #1

Changes from 1 commit
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
a9686ef
Wrote the appened method for the ring-buffer
ModestoT May 10, 2019
407df60
completed the ring_buffer file and passed all test
ModestoT May 10, 2019
880c217
got the runtime for the names.py file to be 1.3 seconds on first pass
ModestoT May 10, 2019
46ae7ac
while researching python data sctructures i came upon sets. This let …
ModestoT May 10, 2019
7bb4db8
labeled a possible stretch solution
ModestoT May 10, 2019
45d175d
answered the questions in the answers.md file
ModestoT May 10, 2019
6e4c266
answered questions in answers.md file
ModestoT May 10, 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
Prev Previous commit
Next Next commit
while researching python data sctructures i came upon sets. This let … 
…to a solution with a runtime of .00399 secs
  • Loading branch information
@ModestoT
ModestoT committed May 10, 2019
commit 46ae7ac45383181529230fa60603852eff3a8fa8
11 changes: 7 additions & 4 deletions names/names.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,14 +10,17 @@
names_2 = f.read().split("\n") # List containing 10000 names
f.close()

duplicates = []
# duplicates = []
# for name_1 in names_1:
# for name_2 in names_2:
# if name_1 == name_2:
# duplicates.append(name_1)
for i in names_1:
if i in names_2:
duplicates.append(i)
# for i in names_1: 1.35 secs
# if i in names_2:
# duplicates.append(i)
# duplicates = [i for i in names_1 if i in names_2] 1.29 secs

duplicates = set(names_1).intersection(names_2) # .00399 secs

end_time = time.time()
print (f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")
Expand Down