All submissions

Find Duplicate in Range 0 and n-1

Code

#include <stdio.h>

int find_duplicate(int arr[], int n) {
    // Your logic here
    //return -1;

    for (int x = 0; x < n; x++)
    {
        int comp_arr = arr[x];
        for(int y = x + 1; y < n; y++)
        {
            if (comp_arr == arr[y]) return arr[x];
        }
        
    }
}

int main() {
    int n;
    scanf("%d", &n);

    int arr[100];
    for (int i = 0; i < n; i++) scanf("%d", &arr[i]);

    int result = find_duplicate(arr, n);
    printf("%d", result);
    return 0;
}

Solving Approach

 

 

 

Loading...

Input

5 0 1 2 3 2

Expected Output

2