136. Single Number **

Given an array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

My code:

I wanted to obtain the frequency of each digits. It's  such a clumsy method. 

from collections import Counter
class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        
        st=sorted(Counter(nums).iteritems(),key = lambda asd:asd[1], reverse = False)
        for key in range(len(st)):
            if st[key][1]==1:
                return st[key][0]          
        return 0

Method 1;

XOR

https://discuss.leetcode.com/topic/1916/my-o-n-solution-using-xor

    def singleNumber(self,nums):
        result= nums[0]
        for i in range (1,len(nums)):
            result = result ^ nums[i]
        return result

Method 2:

    def singleNumber(self, A):
        return reduce(operator.xor, A)