Question

Solve the following problem on the Hacker Rank website: Team Formation 

(https://www.hackerrank.com/challenges/team-formation) You are required to use Hashtable to solve this problem. Note: there are 20 test cases for this problem on the website.

Answer 1

Source code:-

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

class group {
    int start;
    int end;
    int count;
}

public class TeamFormation {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
    TeamFormation sol1 = new TeamFormation();
        sol1.process();
    }
    public void process() {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t = 0; t < T; t++) {
            int n = sc.nextInt();
            if (n == 0) {
                System.out.println(0);
                continue;
            }
            int[] num = new int[n];
            for (int i = 0; i < n ; i++)
                num[i] = sc.nextInt();
            Arrays.sort(num);
            int count = 1;
            int min = 999999999;
            int i = 0;
            ArrayList groups = new ArrayList();
            for (i = 0; i < n ; i++) {
                int min_group = 99999999;
                int min_count = 99999999;
                boolean flag = false;
                for (int j = groups.size() -1 ; j >= 0 ; j--) {
                    if(groups.get(j).end + 1 == num[i]) {
                        flag = true;
                        if (groups.get(j).count < min_count) {
                            min_count = groups.get(j).count;
                            min_group = j;
                        }
                    }
                    else if (groups.get(j).end != num[i])
                        break;
                }
                if (flag == true) {
                    group g1 = groups.get(min_group);
                    g1.end = num[i];
                    g1.count++;
                    groups.remove(min_group);
                    groups.add(g1);
                }
                else {
                    group g1 = new group();
                    g1.start = num[i];
                    g1.end = num[i];
                    g1.count = 1;
                    groups.add(g1);
                }
                /*for (int j = 0; j < groups.size(); j++)
                    System.out.print(groups.get(j).end + " ");
                System.out.println();*/
            }
            for (i = 0; i < groups.size(); i++) {
                if (groups.get(i).count < min)
                    min = groups.get(i).count;
            }
            System.out.println(min);
        }
    }
}

---------------------------------------------------------------------------------------------------------------

Output:-

Change Theme Java 7 1 import java.io. 2 import java.util. import java.text.*; 4 import java.math. import java.util.regex.*; 7 class group f int start; int end; int count; 10 12 13 public class TeamFormation f 15 public static void main(String[] args) f 16 /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution 17曰 18 19 20 public void process ) 21 E TeamFormation sol1new TeamFormation) sol1.process); Scanner scnew Scanner (System.in); intT sc.nextInt; for (int t : t<1;t..) { 23 E 24 int sc. next int ( ) ; n Line: 13 col:27 Test against custom i nput Submit Code Run Code t Upload Code as File You have earned 70.00 points! You are now 181 5 points away from the 4th star for your problem solving badge 34% 293.5/475 bbi Congratulations You solved this challenge. Would you like to challenge your friends? fin Next Challenge Compiler Message Test case 14 Success Test case 15 Input (stdin) Test case 16 4 7 4 52 3-4 -3-5 Test case 17 C 4 3 23 1 71-2-3-4 2 θ-1 Test case 18 Expected Output Test case 19 C Test case 20