Question

Coding Question: You are given an set of numbers {1..N} and an array A[N-1]. Find the number from the set that is not present in the array. (IN JAVA, without using HashSet) a. Include comments within your code. Be detailed. b. What other approaches did you consider to solve this question and why did you choose this approach?

Answer 1

Code:

import java.io.*;
import java.util.*;
class Compare
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int i,flag,j,n1,n2;
/*Accepting Number Of Elements Of Set*/
System.out.println("Enter Number Of Elements In Set");
n1=sc.nextInt();
/*Creating Array Named set to Hold The Set Elements*/
int set[]=new int[n1];

/*Accepting Number Of Elements(Length) Of Array*/
System.out.println("Enter The Elements Of Set");
for(i=0;i<n1;i++)
{
set[i]=sc.nextInt();
}
/*Accepting The Array Elements*/
System.out.println("Enter The Number Of Elements In Array");
n2=sc.nextInt();
int arr[]=new int[n2];
System.out.println("Enter The Array Elements");
for(i=0;i<n2;i++)
{
arr[i]=sc.nextInt();
}

/*Finding Numbers From Set That Are Not Present In Array*/
/*Nested For Loops For Comparison Of Set Elements And Array Elements*/
for(i=0;i<n1;i++)
{
flag=0;
for(j=0;j<n2;j++)
{
if(set[i]==arr[j])
{
flag=1;
/*If flag=1 then ith element of set is found at jth index in array*/
}
}
/*If flag=0 then elements ith element of set is not found in array */
if(flag==0)
{
System.out.println(set[i]+" Not Found In Array");
}
}

}
}

Output Screenshot:

Please Up-Vote,If You Find This Solution Helpful !!

In Case Of Any Doubt/Query Feel Free To Comment Down Below.