my code works for all the other tests on check50 besides the one for txt18. I checked the Large.csv file and the return value of longest_match function (both provided by cs50) and they match up yet ...
I need some advises how i can improve my code and make it more pythonic. Cause i feel like my code is too long.
This is my solution to cs50 DNA problem:
if len(sys.argv) != 3:
Hi all I'm having trouble for PSET6 DNA. My code works fine for everything up until and including 4.txt but whenever I go to check the large.csv file and thus 5.txt, 6.txt, 7.txt and so on I seem to ...
I am trying to compute the most repeated STR for each sequence in a dictionary called str_dict.
# compute STRs
i = 0
# stablish length of the sequence
length_seq = len(sequence)
# iterate through all ...
My code works fine for the small csv file; however, when I get to the big csv file, my counts for the number of consecutive STR are less than the actual value by about 1 or 2.
Here is my code: