Find Unique Number

Medium Bitwise Operations

Solve in Playground →

Problem Statement

Given an array where every element appears twice except one, write a C program to find that single unique element using bitwise XOR.

Input Format

The first line contains N (size of array). The second line contains N space-separated integers.

Output Format

Print the unique number.

Constraints

1 <= N <= 1000, N is odd

Sample Input

5
2 3 5 3 2

Sample Output

Explanation

2 and 3 appear twice, while 5 appears once.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        int arr[n];
        for (int i = 0; i < n; i++) {
            scanf("%d", &arr[i]);
        }
        // Write your code here
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →