Take an input string and return a string that is made up of the number of occurences of each english letter in the input followed by that letter, sorted alphabetically. The output string shouldn't contain chars missing from input (chars with 0 occurence); leave them out.

An empty string, or one with no letters, should return an empty string.

Notes:

* the input will always be valid;
* treat letters as **case-insensitive**


## Examples

```
"This is a test sentence."  ==>  "1a1c4e1h2i2n4s4t"
""                          ==>  ""
"555"                       ==>  ""
```

Difficulty: introductory

Starter code:

def string_letter_count(s):
	

Solutions:
from collections import Counter

def string_letter_count(s):
    cnt = Counter(c for c in s.lower() if c.isalpha())
    return ''.join(str(n)+c for c,n in sorted(cnt.items()))

def string_letter_count(s):
    s = s.lower()
    m = ''
    for i in sorted(list(set(s))):
        if i.islower():
            m += str(s.count(i)) + i
    return m

from collections import Counter

def string_letter_count(s):
    cnt = Counter(filter(str.isalpha, s.lower()))
    return ''.join(f'{v}{k}' for k, v in sorted(cnt.items()))

def string_letter_count(s):
    s = s.lower()
    L1=[]
    for i in s:
        L1.append(i)
    L1.sort()
    s = "".join(L1)
    A={"a":1,"b":2,"c":3,"d":4,"e":5,"f":6,"g":7,"h":8,"i":9,"j":10,"k":11,"l":12,"m":13,"n":14,"o":15,"p":16,"q":17,"r":18,"s":19,"t":20,"u":21,"v":22,"w":23,"x":24,"y":25,"z":26}
    L=[]
    for i in s:
        if i not in L:
            if i in A:
                L.append(str(s.count(i)))
                L.append(str(i))
    return "".join(L)

from collections import Counter

def string_letter_count(s):
    counts = Counter(filter(str.islower, s.lower()))
    return ''.join(f'{n}{c}' for c, n in sorted(counts.items()))


def string_letter_count(s):
    return "".join(str(s.count(i.lower()) + s.count(i.upper()))+i for i in sorted(set(list(s.lower()))) if i.isalpha())



import string
def string_letter_count(s):
    alphabet=string.ascii_lowercase
    sts=s.strip(" ").lower()
    result=""
    for i in alphabet:
        if i in sts:
            result += "%s%s" %(sts.count(i),i)
            
    return result

def string_letter_count(s):
    s = s.lower()
    split = list(s)
    split.sort()
    string = ""
    for i in split:
       if i >= 'a' and i <= 'z' and i not in string:
          string = string + str(split.count(i))
          string += i
    return string
          
        
          
    


def string_letter_count(s):
    answer = ''
    for i in sorted(set(s.lower())):
        if i.isalpha():
            answer += f'{s.lower().count(i)}{i}'
    return answer

from collections import Counter
def string_letter_count(s):
    c=Counter([c for c in s.lower() if c.isalpha()])
    r=''
    for k in sorted(c.keys()):
        r+=str(c[k])+k
    return r