Write a function to find the first non-repeated character in a string. To solve this problem, if we pick the first character and then compare the character with the remaining string then we would be actually require n comparisons for n elements, that is worst case complexity of O(n2).