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. Prepare
  2. Algorithms
  3. Bit Manipulation
  4. Lonely Integer
  5. Discussions

Lonely Integer

Sort by

recency

|

569 Discussions

|

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the vidéo explanation here : https://youtu.be/E4PVCUOdeXM

        int result = 0;
    for(int x: a) result ^= x;
    return result;
}

  • delowery
     + 0 comments

    hi yall

  • delowery
     + 0 comments

    hi yall

  • abhayad268207
     + 0 comments

    Solution in Python ||Easy and Simple to understand

    Please upvote to help others .

    Without using xor operator

# a.sort()
    # for i in range(0,len(a)-1,2):
    #     if (a[i] == a[i+1]):
    #         continue
    #     else:
    #         return a[i]
            
    # return a[len(a)-1]
		
		#Using XOR operator
		
    result=0
    for i in a:
        result^=i
    return result

  • delowery
     + 0 comments

    (09)