**This Kata is intended as a small challenge for my students**

All Star Code Challenge #16

Create a function called noRepeat() that takes a string argument and returns a single letter string of the **first** not repeated character in the entire string.

``` haskell
noRepeat "aabbccdde" `shouldBe` 'e'
noRepeat "wxyz"      `shouldBe` 'w'
noRepeat "testing"   `shouldBe` 'e'
```

Note:
ONLY letters from the english alphabet will be used as input
There will ALWAYS be at least one non-repeating letter in the input string

Difficulty: introductory

Starter code:

def no_repeat(string):
	

Solutions:
def no_repeat(s):
    return next(c for c in s if s.count(c) == 1)

def no_repeat(string):
    return [x for x in string if string.count(x) == 1][0]

from collections import Counter

# Only work in 3.6+ because dicts are ordered
def no_repeat(string):
    return next(k for k,v in Counter(string).items() if v == 1)

no_repeat=lambda s: [w for w in s if s.count(w)==1][0]

def no_repeat(stg):
    return next(c for c in stg if stg.count(c) == 1)

def no_repeat(string):
    for e in string:
        if string.count(e)==1: 
            return e 

def no_repeat(string):
    if string.count(string[0]) == 1:
        return string[0]
    else:
        return no_repeat(string.replace(string[0], ''))

def no_repeat(string):
    #your code here
    return min(string, key=string.count)

def no_repeat(string):
    for c in string:
        if len(string.split(c)) == 2:
            return c

def no_repeat(string):
    for i in string:
        if string.index(i) == len(string)-string[::-1].index(i)-1: return i