HackerEarth Min-Max problem solution

In this HackerEarth Min-Max problem solution, we have given an array of integers. Check if all the numbers between the minimum and maximum number in the array exist within the array. Print ‘YES’ if numbers exist otherwise print ‘NO'(without quotes).

HackerEarth Min-Max problem solution.

#include<stdio.h>
intmain(){

    intn;
    scanf("%d",&n);
    intarr[n];
    for(inti=0;i<n;i++){
        scanf("%d",&arr[i]);

    }

    intmin=arr[0];
    intmax=arr[0];
    intflag=0;

    for(inti=0;i<n;i++){

        if(min>arr[i]){

            min=arr[i];

        }

        if(max<arr[i]){
            max=arr[i];

        }

    }

    for(inti=min;i<max;i++){
        for(intj=0;j<n;j++){

            if(arr[j]==i){


                flag++;
                break;
            }
        }
    }

    intk=max-min;
    if(flag==k){

        printf("YES");
    }
    else{

        printf("NO");

    }
    return0;

}

coding problems solutions