We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Lonely Integer
  2. Discussions

Lonely Integer

Sort by

recency

|

928 Discussions

|

  • priyanka28211519
     + 0 comments

    easy way is XOR elements try new Cool method in C#

  • pintoovida
     + 0 comments

    js:

    function lonelyinteger(a) { let a1 = a.sort();

    for(let i=0; i<a1.length; i++){
   if(a1[i]!=a1[i+1]&& a1[i]!=a1[i-1])
   {
    return a1[i];
   }

}

    }

  • lavinia_000
     + 0 comments
    def lonelyinteger(a):
    a.sort()
    pil = []
    for number in a:
        if number in pil:
            pil.pop()
        else:
            pil.append(number)
    return pil[-1]

  • smohammed36
     + 0 comments
    uniqueElement = 0
for item in a:
    if a.count(item) == 1:
        uniqueElement = item

return uniqueElement

  • mohamedhari317
     + 0 comments
    

    for i in a:
    if a.count(i)==1:
        return i