Lonely Integer

Sort by

recency

|

461 Discussions

|

  • + 0 comments

    I wanna recieve feedback about my Javascript solution, thxs!:

    function lonelyinteger(a) {
        // Write your code here
        a.sort((a, b) => a - b);
        let aux=0
        for(let i=0;i<a.length;i++){
            if(a[i]!=a[i+1]) aux=a[i]
            else i++
        }
        return aux;
    
    }
    
  • + 0 comments
    func lonelyinteger(a []int32) int32 {
        // Write your code here
        // var r int32 = 0
        // for _, a := range a{
        //     r ^= a
        // }
        // return r
        var result int32 = 0
        m := make(map[int32]int32)
        for _, v :=range a{
            value, exists := m[v]
            if exists{
                m[v] = value+1
                // fmt.Printf("Exist: key= %d, not= %d", v, value+1)
            }else{
                m[v] = 1
                // fmt.Printf("Newone: key= %d, not= %d", v, 1)
            }
        }
        for key, value := range m{
            if value == 1{
                result = key
            }
        }
        return result
    }
    
  • + 0 comments
    def lonelyinteger(a):
        # Write your code here
        count_array=[0]*100
        
        for i in a:
            count_array[i]+=1
            
        for i in range(0,len(count_array)):
            if count_array[i]==1:
                return i
    
  • + 0 comments

    def lonelyinteger(a): # Write your code here data = Counter(a)

    for key, value in data.items():
        if value == 1:
            return key
    
  • + 0 comments

    Python solution using dictionary instead of Counter method

    def lonelyinteger(a):
        count = {}
        for i in a:
            if i in count:
                count[i] += 1
            else:
                count[i] = 1
        
        out = [ele for ele in count.keys() if count[ele] == 1][0]
        return out