I’m super close. But I cannot figure out right formula. It doesn’t count amount of the similar substrings correctly. I mean the output is wrong.
You have some substrings that are shorter than the others because there are no n
characters left at index i
.
How many substrings of length n
can you have in a string of length len(a)
? n
is part of the formula that goes into the range
call.
-
when I do for i in range ( len(a)- n-1) I get the same result as without n. – IrinaPenzina Oct 1 '18 at 15:34
-
-n
looks fine, but imaginelen(a)
andn
were the same, how many possible substrings would you expect?-1
? – Blauelf Oct 1 '18 at 16:17 -
I rearranged the code and it worked. I put everything in return and some magic happened. – IrinaPenzina Oct 2 '18 at 4:13
Look at your asub and bsub right before returning an answer. (you can use print to see what they are). Looks like they're getting re-defined for each i rather than accumulating a list of all possible options.