Have the function LetterCountI(str) take the str parameter being passed and return the first word with the greatest number of repeated letters. For example: "Today, is the greatest day ever!" should return greatest because it has 2 e's (and 2 t's) and it comes before ever which also has 2 e's. If there are no words with repeating letters return …

lettercount.py

def LetterCountI(str): 
  
  l = []
  index = 0
  for k,i in enumerate(str.split(' ')):
    d = {}
    for j,c in enumerate(i):
      d[c] = d.get(c,0) + 1
    d = {key: value for key, value in d.items() if value != 1}
    if (not l):
      l.append(d)
    else:
      if len(l) > 0 and d:
        if len(l[-1]) < len(d):
          l.pop()
          l.append(d)
          index = k    
  if l[0]:
    return str.split(' ')[index]
  else:
    return "-1"