CODING QUESTION 4

A college has opened registrations for a course. Due to the pandemic, the college has given both online and offline modes of registrations to that course. As an administrator, you are given the task to find the students who have applied for both online and offline modes and rectify it. 

(This answer is from a source of mine. Feel free to post your answers in as well.)

CODE:

import java.util.Scanner;

import java.util.concurrent.ThreadLocalRandom;

//function which prints  all the duplicate id's

public class Duplicates1 {

    public void findDuplicates(int[] id) {

        System.out.println("Duplicate student id : ");

        for (int i = 0; i < id.length; i++) {

            for (int j = i+1; j < id.length; j++) {

                if (id[i] == id[j]) {

                    System.out.print(id[i] + " ");

                    break;

                }

            }

        }

    }

    public static void main(String args[]) {

        Scanner sc = new Scanner(System.in);

        System.out.println("Enter the no of student ids in given database : ");

        int n = sc.nextInt();

        int id[] = getInput(n);

        System.out.println("Student id : ");

        printId(id);

        Duplicates1 duplicates = new Duplicates1();

        duplicates.findDuplicates(id);

    }

    //returns an array of n random numbers 

    public static int[] getInput(int n) {

        int input[] = new int[n];

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

            input[i] = randomNumber(1,2*n);

        }

        return input;

    }

    //returns a random number

    public static int randomNumber(int min, int max) {

        int randomNumber = ThreadLocalRandom.current().nextInt(min, max + 1);//returns a random number in the specified range

        return randomNumber;

    }

    //prints all the values of an array id

    public static void printId(int[] id) {

        for (int i = 0; i < id.length; i++) {

            System.out.print(id[i] + " ");

        }

        System.out.println();

    }

}

Please check out this page for more updates.... and follow too !