http://community.topcoder.com/stat?c=round_overview&er=5&rd=15492

def myfunc(s,k):

res = 0

incr = len(s)-k

for i in range(0,incr):

# find the first set of alphabets which don't match

j = i

t = {}

ctr = 0

#print "i:",str(i)

while j<len(s):

#print "j:",str(j)

if s[j] in t:

t[s[j]] += 1

else:

t[s[j]] = 1

j += incr

ctr += 1

mx = max(t.values())

res += ctr - mx

return res

def myfunc(s,k):

res = 0

incr = len(s)-k

for i in range(0,incr):

# find the first set of alphabets which don't match

j = i

t = {}

ctr = 0

#print "i:",str(i)

while j<len(s):

#print "j:",str(j)

if s[j] in t:

t[s[j]] += 1

else:

t[s[j]] = 1

j += incr

ctr += 1

mx = max(t.values())

res += ctr - mx

return res

## No comments:

## Post a Comment