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

  • ameyanator
     + 4 comments

    People are using many techniques but i consider the easiest to be XOR gate.This question is meant to be solved using Xor gate. Here is my Code-

    #include <iostream>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int ans=0;
	for(int i=0;i<n;i++)
	{
		int x;
		cin>>x;
		ans^=x;
	}
	cout<<ans<<endl;
}